JUCS - Journal of Universal Computer Science 12(8): 981-1006, doi: 10.3217/jucs-012-08-0981
Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM
expand article infoWan Fokkink, Jun Pang§
‡ Vrije Universiteit, Netherlands§ Universitat Oldenburg, Germany
Open Access
We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [Itai and Rodeh 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. Furthermore, we give a manual correctness proof for each algorithm.
distributed computing, leader election, anonymous networks, probabilistic algorithms, formal verification, model checking