Memory-efficient self stabilizing protocols for general networks

Yehuda Afek, Shay Kutten, Moti Yung

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationDistributed Algorithms - 4th International Workshop, Proceedings
EditorsJan van Leeuwen, Nicola Santoro
PublisherSpringer Verlag
Number of pages14
ISBN (Print)9783540540991
StatePublished - 1991
Event4th International Workshop on Distributed Algorithms, WDAG 1990 - Bari, Italy
Duration: 24 Sep 199026 Sep 1990

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume486 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference4th International Workshop on Distributed Algorithms, WDAG 1990


Dive into the research topics of 'Memory-efficient self stabilizing protocols for general networks'. Together they form a unique fingerprint.

Cite this