Sciweavers

14 search results - page 1 / 3
» A probabilistic analysis of a leader election algorithm
Sort
View
JUCS
2006
124views more  JUCS 2006»
13 years 4 months ago
Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM
Abstract: 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 1...
Wan Fokkink, Jun Pang
WDAG
2000
Springer
87views Algorithms» more  WDAG 2000»
13 years 8 months ago
A Probabilistically Correct Leader Election Protocol for Large Groups
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...
Indranil Gupta, Robbert van Renesse, Kenneth P. Bi...
IPL
2011
91views more  IPL 2011»
12 years 8 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
DC
2007
13 years 4 months ago
Randomized leader election
d bins abstraction and works in two phases. The main novelty of the work is in the first phase where the number of contending processes is reduced in a controlled manner. Probabil...
Murali Krishna Ramanathan, Ronaldo A. Ferreira, Su...