Publication View

Simplifying Itai-Rodeh Leader Election for Anonymous Rings (2004)

Abstract
We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [20]. 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. Furthermore, we give a manual correctness proof for each algorithm.

Publication details
Download http://citeseer.ist.psu.edu/697665.html
Source http://www.cwi.nl/ftp/CWIreports/SEN/SEN-R0405.pdf
Publisher unknown
Contributors The Pennsylvania State University CiteSeer Archives
Repository CiteSeer (United States)
Keywords W. J. Fokkink,J. Pang Simplifying Itai-Rodeh Leader Election for Anonymous Rings
Language Englisch
Relation oai:CiteSeerPSU:310136, oai:CiteSeerPSU:453924, oai:CiteSeerPSU:452238, oai:CiteSeerPSU:159894, oai:CiteSeerPSU:324776, oai:CiteSeerPSU:147192, oai:CiteSeerPSU:93940, oai:CiteSeerPSU:187254, oai:CiteSeerPSU:258264, oai:CiteSeerPSU:673235, oai:CiteSeerPSU:68158, oai:CiteSeerPSU:689395, oai:CiteSeerPSU:707789