This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Uniform Dynamic Self-Stabilizing Leader Election
April 1997 (vol. 8 no. 4)
pp. 424-440

Abstract—A distributed system is self-stabilizing if it can be started in any possible 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 uniform if all processors with the same number of neighbors are identical. A distributed system is dynamic 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 $O\left( {\Delta {\cal D}\log n} \right)$ time when the number of the processors is unknown and $O\left( {\Delta {\cal D}} \right),$ otherwise. Here Δ denotes the maximal degree of a node, ${\cal D}$ denotes the diameter of the graph and n 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 ranking protocol.

[1] K. Abrahamson,A. Adler,L. Higham,, and D. Kirkpatrick,“Probabilistic solitude verification on a ring,” Proc. Fifth Ann. ACM Symp. on Principles of Distributed Computing,Quebec City, Aug. 1986 pp. 161-173.
[2] H. Attiya,M. Snir,, and M. Warmuth,“Computing on an anonymous ring,” J. ACM, vol. 35, no. 4, pp. 845-875, Oct. 1988.
[3] K. Abrahamson,“On achieving consensus using a shared memory,” Proc. Seventh Ann. ACM Symp. Principles Distributed Computing,Toronto, Canada, pp. 291-302, Aug. 1988.
[4] E. Angnostou and R. El-Yaniv,“More on the power of random walks: Uniform self-stabilizing algorithms,” Lecture Notes in Computer Science 579: Distributed Algorithms, S. Toueg, P.G. Spirakis, and L. Kirousis, eds., pp. 31-51, Springer-Verlag, 1992.
[5] A. Arora and M. Gouda:, “Distributed reset,” Lecture Notes inComputer Science 472: Foundations of Software Technology and TheoreticalComputer Science, K.V. Nori and C.E. Veni Madhavan, eds., pp. 316-331, Springer-Verlag, 1990.
[6] Y. Afek,S. Kutten,, and M. Yung,“Memory-efficient self-stabilization on general networks,” Lecture Notes in Computer Science 486: Distributed Algorithms, J. Van Leeuwen and N. Santoro, eds., pp. 15-28, Springer-Verlag, 1991.
[7] Y. Afek, S. Kutten, and M. Yung, "Local Detection for Global Self-Stabilization," preprint.
[8] B. Awerbuch and G. Varghese, "Distributed Program Checking a Paradigm for Building Self-Stabilizing Distributed Protocols," Proc. 31st Ann. IEEE Symp. Foundations of Computer Science, pp. 268-277, 1991.
[9] B. Awerbuch, “Complexity of Network Synchronization,” J. ACM, vol. 32, pp. 804–823, 1985.
[10] G.M. Brown, M.G. Gouda, and C.L. Wu, "A Self-Stabilizing Token System," Proc. 20th Ann. Hawaii Int'l Conf. System Sciences, pp. 218-223, 1987.
[11] J.E. Burns and J. Pachl,“Uniform self-stabilizing rings,” ACM Trans. Programming Languages and Systems, vol. 11, no. 2, pp. 330-344, Apr. 1989,.
[12] J.E. Burns, "Self-Stabilizing Rings Without Demons," Technical Report GIT-ICS-8736, Georgia Inst. of Tech nology.
[13] B.S. Chlebus, K. Diks, and A. Pelc, "Fast Gossiping With Short Unreliable Messages," Discrete Applied Math., special issue on gossiping, vol. 53, pp. 15-24, 1994.
[14] E.W. Dijkstra,“Self-stabilizing systems in spite of distributed control,” Comm. ACM, vol. 17, no. 11 pp. 643-644, 1974,.
[15] S. Dolev, A. Israeli, and S. Moran, "Self Stabilization of Dynamic Systems," Proc. Ninth Ann. ACM Symp. Principles of Distributed Computing,Quebec City, pp. 103-118, Aug. 1990. Distributed Computting vol. 7, pp. 3-16, 1993.
[16] S. Dolev,A. Israeli,, and S. Moran,“Uniform dynamic self-stabilizing leader election,” Lecture Notes in Computer Science 579: Distributed Algorithms, S. Toueg, P.G. Spirakis, and L. Kirousis, eds., pp. 163-180, Springer-Verlag, 1992.
[17] S. Dolev, A. Israeli, and S. Moran, "Analyzing Expected Time by Scheduler-Luck Games," IEEE Trans. Software Eng., vol. 21, no. 5, pp. 429-439, May 1995.
[18] R.G. Gallager, "Finding a Leader in Networks With O(E) + O(N log N) Messages," Internal Memo., M.I.T., Cambridge, Mass., 1978.
[19] S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, "A Survey of Gossiping and Broadcasting in Comm. Networks," Networks, vol. 18, pp. 319-349, 1988.
[20] P. Humblet, "Selecting a Leader in a Clique in O(N log n) Messages. Internal Memo., Laboratory for Information and Decision Systems, M.I.T., Cambridge, Mass., 1984.
[21] A. Israeli and M. Jalfon,“Token management schemes and random walks yield self-stabilizing mutual exclusion,” Proc. Ninth Ann. ACM Symp. Principles of Distributed Computation,Quebec City, Aug. 1990, pp. 119-132.
[22] A. Israeli and M. Jalfon,“Self-stabilizing ring orientation,” Lecture Notes in Computer Science 486: Distributed Algorithms, J. Van Leeuwen and N. Santoro, eds., pp. 1-14, Springer-Verlag, 1991.
[23] A. Itai and M. Rodeh,“Probabilistic methods for breaking symmetry in distributed networks,” Information and Computation, vol. 88, no. 1, pp. 60-87, 1990.
[24] E. Korach,S. Kutten,, and S. Moran,“A modular technique for the design of efficient distributed leader finding algorithms,” ACM Trans. Programming Languages and Systems, vol. 12, no. 1, pp. 84-10, 1990.
[25] E. Korach,S. Moran,, and S. Zaks,“Tight lower and upper bounds for some distributed algorithms for completenetwork of processors,” Proc. Third Ann. ACM Symp. Principles of Distributed Computing, pp. 199-207, 1984.
[26] S. Katz and K. J. Perry,“Self-stabilizing extensions for message-passing systems,” Proc. Ninth Ann. ACM Symp. Principles of Distributed Computing,Quebec City, pp. 91-101, Aug. 1990.
[27] L. Lamport,“The mutual exclusion problem: Part II-Statement and solutions,” J. Assoc. for Computing Machinery, vol. 33, no. 2, pp. 327-348, 1986.
[28] Y. Matias and Y. Afek, "Simple and Efficient Election Algorithms for Anonymous Networks," manuscript, 1989.
[29] A. Segall, "Distributed Networks Protocols," IEEE Trans. Comm., vol. 29, no. 1, pp. 23-35, Jan. 1983.
[30] B. Schieber and M. Snir,“Calling names on nameless networks,” Proc. Eighth Ann. ACM Symp. Principles of Distributed Computing,Edmonton, pp. 319-328, Aug. 1989.
[31] M. Tchuente, "Sur l'auto-stabilisation dans un réseau d'ordinateurs," RAIRO Inf. Theor., vol. 15, pp. 47-66, 1981.

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 and Distributed Systems, vol. 8, no. 4, pp. 424-440, April 1997, doi:10.1109/71.588622
Usage of this product signifies your acceptance of the Terms of Use.