Self-stabilizing anonymous leader election in a tree

We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n/sup 4/) time starting from any arbitrary initial state. The protocol can elect either a leaf node or a non-leaf node (starting from the same initial state) depending on the behavior of the daemon. The protocol generalizes the result in [Antonoiu, G et al. (1996)] and at the same time is much simpler and terminates in polynomial number of moves.

[1]  Janos Simon,et al.  Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings , 1995, WDAG.

[2]  Amos Israeli,et al.  Uniform Dynamic Self-Stabilizing Leader Election , 1997, IEEE Trans. Parallel Distributed Syst..

[3]  Pradip K. Srimani,et al.  A Self-Stabilizing Leader Election Algorithm for Tree Graphs , 1996, J. Parallel Distributed Comput..

[4]  Marcos K. Aguilera,et al.  Stable Leader Election , 2001, DISC.

[5]  Leslie Lamport Solved problems, unsolved problems and non-problems in concurrency , 1985, OPSR.

[6]  Faith Ellen,et al.  A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings , 2001, DISC.

[7]  Maria Gradinariu Potop-Butucaru,et al.  Memory space requirements for self-stabilizing leader election protocols , 1999, PODC '99.

[8]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[9]  Shing-Tsaan Huang,et al.  Leader election in uniform rings , 1993, TOPL.

[10]  Jan K. Pachl,et al.  Uniform self-stabilizing rings , 1988, TOPL.

[11]  Edsger W. Dijkstra A belated proof of self-stabilization , 2005, Distributed Computing.

[12]  Mohamed G. Gouda,et al.  Stabilizing Unison , 1990, Inf. Process. Lett..

[13]  Arobinda Gupta,et al.  An Exercise in Fault-Containment: Self-Stabilizing Leader Election , 1996, Inf. Process. Lett..

[14]  Pradip K. Srimani,et al.  A Self-stabilizing Distributed Algorithm for all-pairs Shortest Path Problem , 1994, Parallel Algorithms Appl..

[15]  Shlomi Dolev,et al.  Self-Stabilizing Depth-First Search , 1994, Inf. Process. Lett..

[16]  Anish Arora,et al.  Maintaining Digital Clocks In Step , 1991, WDAG.