TY - GEN

T1 - Memory-efficient self stabilizing protocols for general networks

AU - Afek, Yehuda

AU - Kutten, Shay

AU - Yung, Moti

N1 - Publisher Copyright:
© 1991, Springer Verlag. All rights reserved.

PY - 1991

Y1 - 1991

N2 - A self stabilizing protocol for constructing a rooted spanning tree in an arbitrary asynchronous network of processors that communicate through shared memory is presented. The processors have unique identifiers but are otherwise identical. The network topology is assumed to be dynamic, that is, edges can join or leave the computation before it eventually stabilizes. The algorithm is design uses a new paradigm in self stabilization. The idea is to ensure that if the system is not in a legal state (this is a global condition) then a local condition of some node will be violated. Thus the new could restart the algorithm. The algorithm provides an underlying self-stabilization mechanism and can serve as a basic building block in the construction of self stabilizing protocols for several other applications such as: mutual-exclusion, snapshot, and reset. The algorithm is memory efficient in that it requires only a linear size memory of words of size log n (the size of an identity) over the entire network. Each processor needs a constant number of words per incident link, thus the storage requirement is in the same order of magnitude as the size of the traditionally assumed message buffers size. The adversary may be permitted to initiate the values of the variables to any size. Still, in this case the additional memory used by the algorithm is the amount stated above. Extensions of our algorithm to other models are also discussed.

AB - A self stabilizing protocol for constructing a rooted spanning tree in an arbitrary asynchronous network of processors that communicate through shared memory is presented. The processors have unique identifiers but are otherwise identical. The network topology is assumed to be dynamic, that is, edges can join or leave the computation before it eventually stabilizes. The algorithm is design uses a new paradigm in self stabilization. The idea is to ensure that if the system is not in a legal state (this is a global condition) then a local condition of some node will be violated. Thus the new could restart the algorithm. The algorithm provides an underlying self-stabilization mechanism and can serve as a basic building block in the construction of self stabilizing protocols for several other applications such as: mutual-exclusion, snapshot, and reset. The algorithm is memory efficient in that it requires only a linear size memory of words of size log n (the size of an identity) over the entire network. Each processor needs a constant number of words per incident link, thus the storage requirement is in the same order of magnitude as the size of the traditionally assumed message buffers size. The adversary may be permitted to initiate the values of the variables to any size. Still, in this case the additional memory used by the algorithm is the amount stated above. Extensions of our algorithm to other models are also discussed.

UR - http://www.scopus.com/inward/record.url?scp=85030073262&partnerID=8YFLogxK

U2 - 10.1007/3-540-54099-7_2

DO - 10.1007/3-540-54099-7_2

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85030073262

SN - 9783540540991

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 15

EP - 28

BT - Distributed Algorithms - 4th International Workshop, Proceedings

A2 - van Leeuwen, Jan

A2 - Santoro, Nicola

PB - Springer Verlag

T2 - 4th International Workshop on Distributed Algorithms, WDAG 1990

Y2 - 24 September 1990 through 26 September 1990

ER -