2008 **Abstract:** Abstract. We present a probabilistic leader election algorithm for anonymous, bidirectional, asynchronous rings. It is based on an 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 can 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 …

Help me understand this report

Search citation statements

Paper Sections

Select...

2

1

1

Citation Types

0

20

0

Year Published

2009

2017

Publication Types

Select...

3

Relationship

3

0

Authors

Journals

(20 citation statements)

(43 reference statements)

0

20

0

“…We also include a number of distributed algorithms. We ported the probabilistic leader election protocols [3], based on DolevKlawe-Rodeh and Franklin, from μCRL to mCRL2. We also included Hesselink's hardware register [27].…”

confidence: 99%

“…We also include a number of distributed algorithms. We ported the probabilistic leader election protocols [3], based on DolevKlawe-Rodeh and Franklin, from μCRL to mCRL2. We also included Hesselink's hardware register [27].…”

confidence: 99%

“…We recapitulate the notion of partition refinement with partial signatures in Sect. 3. Section 4 discusses how we extended Sylvan to parallelise signature-based partition refinement.…”

confidence: 99%

“…swp6 A version of the sliding window protocol [1]. It has 2 data elements, the channels can contain at most one element and the window size is 6. fr53 A model of Franklin's leader election protocol for anonymous processes along a bidirectional ring of asynchronous channels, which terminates with probability one [2,11]. We chose an instance with 5 nodes and 3 identities.…”

confidence: 99%

“…A τ-step is silent if the source and destination are equivalent (with respect to the previous partition) 2. http://fmt.cs.utwente.nl/tools/ltsmin/ …”

mentioning

confidence: 99%

“…For such rings, the best known election algorithms are [15,10,13,5] with average message complexity Θ(n log n). Itai and Rodeh [16] have proposed an algorithm for synchronous unidirectional anonymous rings; its average message complexity is O(n).…”

confidence: 99%