Paper Info
Title
Leader Election in Anonymous Rings: Franklin Goes Probabilistic
Abstract
We present a probabilistic leader election algorithm for anonymous, bidirectional, asynchronous rings. It is based oil all algorithm from Franklin [22], augmented with random identity selection, hop counters to detect identity clashes, and round numbers modulo 2. As a result, the algorithm is finite-state, so that various model checking techniques call be employed to verify its correctness, that is, eventually a unique leader is elected with probability one. We also sketch a formal correctness proof of the algorithm for rings with arbitrary size.
Year
DOI
Venue
2008
10.1007/978-0-387-09680-3_4
International Federation for Information Processing
Keywords
DocType
Volume
leader election,model checking
Conference
273
ISSN
Citations 
PageRank 
1571-5736
8
0.50
References 
Authors
40
6
Name
Order
Citations
PageRank
Rena Bakhshi113712.25
Wan Fokkink2108988.64
Jun Pang352130.59
Jaco Van De Pol4102278.19
vu5856122.39
faculteit der exacte wetenschappen61608154.50