Simplifying Itai-Rodeh Leader Election for Anonymous Rings

We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [A. Itai and M. Rodeh. Symmetry breaking in distributive networks. In Proc. FOCS'81, pp. 150-158. IEEE Computer Society, 1981]. In contrast to the Itai-Rodeh algorithm, our algorithms are finite-state. So they can be analyzed using explicit state space exploration; we used the probabilistic model checker PRISM to verify, for rings up to size four, that eventually a unique leader is elected with probability one.

[1]  Gary L. Peterson,et al.  An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem , 1982, TOPL.

[2]  Valmir Carneiro Barbosa,et al.  An introduction to distributed algorithms , 1996 .

[3]  Daniel S. Hirschberg,et al.  Decentralized extrema-finding in circular configurations of processors , 1980, CACM.

[4]  Ernest J. H. Chang,et al.  An improved algorithm for decentralized extrema-finding in circular configurations of processes , 1979, CACM.

[5]  Jan Friso Groote,et al.  Formal Verification of a Leader Election Protocol in Process Algebra , 1997, Theor. Comput. Sci..

[6]  Marta Z. Kwiatkowska,et al.  PRISM: Probabilistic Symbolic Model Checker , 2002, Computer Performance Evaluation / TOOLS.

[7]  Carron Shankland,et al.  The Tree Identify Protocol of IEEE 1394 in μCRL , 1998, Formal Aspects of Computing.

[8]  Thomas A. Henzinger,et al.  Reactive Modules , 1999, Formal Methods Syst. Des..

[9]  Muffy Calder,et al.  Using SPIN to Analyse the Tree Identification Phase of the IEEE 1394 High-Performance Serial Bus (FireWire) Protocol , 2003, Formal Aspects of Computing.

[10]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[11]  Christel Baier,et al.  Model Checking Continuous-Time Markov Chains by Transient Analysis , 2000, CAV.

[12]  Stephan Merz,et al.  Model Checking , 2000 .

[13]  Masahiro Fujita,et al.  Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation , 1997, Formal Methods Syst. Des..

[14]  Christel Baier,et al.  Model checking for a probabilistic branching time logic with fairness , 1998, Distributed Computing.

[15]  Frits W. Vaandrager,et al.  Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394 , 2000, Formal Methods Syst. Des..

[16]  Alberto Verdejo,et al.  Specification and Verification of the Tree Identify Protocol of IEEE 1394 in Rewriting Logic , 2003, Formal Aspects of Computing.

[17]  Dana Angluin,et al.  Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[18]  W. Randolph Franklin.  On an improved algorithm for decentralized extrema finding in circular configurations of processors , 1982, CACM.

[19]  Hubert Garavel,et al.  Specification and Verification of Various Distributed Leader Election Algorithms for Unidirectional Ring Networks , 1997, Sci. Comput. Program..

[20]  Viktor Schuppan,et al.  Verifying the IEEE 1394 FireWire Tree Identify Protocol with SMV , 2003, Formal Aspects of Computing.

[21]  Alon Itai,et al.  Symmetry breaking in distributive networks , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[22]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

[23]  Judi Romijn.  A Timed Verification of the IEEE 1394 Leader Election Protocol , 2001, Formal Methods Syst. Des..

[24]  Jan Friso Groote,et al.  µCRL: A Toolset for Analysing Algebraic Specifications , 2001, CAV.

[25]  Carron Shankland,et al.  A case study in abstraction using E-LOTOS and the FireWire , 2001, Comput. Networks.

[26]  ChangErnest,et al.  An improved algorithm for decentralized extrema-finding in circular configurations of processes , 1979 .

[27]  Joost-Pieter Katoen,et al.  Algebraic specification of dynamic leader election protocols in broadcast networks , 1995 .

[28]  Danny Dolev,et al.  An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle , 1982, J. Algorithms.

[29]  Alon Itai,et al.  Symmetry breaking in distributed networks , 1990, Inf. Comput..

[30]  Gérard Le Lann,et al.  Distributed Systems - Towards a Formal Approach , 1977, IFIP Congress.