Subscribe
Issue No.04 - April (1997 vol.8)
pp: 424-440
ABSTRACT
<p><b>Abstract</b>—A distributed system is <it>self-stabilizing</it> if it can be started in any <it>possible</it> global state. Once started the system regains its consistency by itself, without any kind of outside intervention. The self-stabilization property makes the system tolerant to faults in which processors exhibit a faulty behavior for a while and then recover spontaneously in an arbitrary state. When the intermediate period in between one recovery and the next faulty period is long enough, the system stabilizes. A distributed system is <it>uniform</it> if all processors with the same number of neighbors are identical. A distributed system is <it>dynamic</it> if it can tolerate addition or deletion of processors and links without reinitialization. In this work, we study uniform dynamic self-stabilizing protocols for leader election under readwrite atomicity. Our protocols use randomization to break symmetry. The leader election protocol stabilizes in <tmath>$O\left( {\Delta {\cal D}\log n} \right)$</tmath> time when the number of the processors is unknown and <tmath>$O\left( {\Delta {\cal D}} \right),$</tmath> otherwise. Here Δ denotes the maximal degree of a node, <tmath>${\cal D}$</tmath> denotes the diameter of the graph and <it>n</it> denotes the number of processors in the graph. We introduce self-stabilizing protocols for synchronization that are used as building blocks by the leader-election algorithm. We conclude this work by presenting a simple, uniform, self-stabilizing <it>ranking</it> protocol.</p>
INDEX TERMS
Self-stabilizing systems, leader election, distributed algorithms, randomized distributed algorithms, synchronization.
CITATION
Shlomi Dolev, Amos Israeli, Shlomo Moran, "Uniform Dynamic Self-Stabilizing Leader Election", IEEE Transactions on Parallel & Distributed Systems, vol.8, no. 4, pp. 424-440, April 1997, doi:10.1109/71.588622