See this document in CiteSeerX!

A Probabilistically Correct Leader Election Protocol for Large Groups  (Make Corrections)  (6 citations)
Indranil Gupta, Robbert van Renesse, Kenneth P. Birman
International Symposium on Distributed Computing



  Home/Search   Context   Related

 
View or download:
cornell.edu/gupta/Papers/tr_le.pdf


From:  cornell.edu/gup...nal_information (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: 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 characterized by probabilistic failure rates of processes and message deliveries. The protocol trades correctness for scale, that is, it provides very good probabilistic guarantees on correct termination in the sense of the classical specification of the election problem, and of generating a constant number of messages, both... (Update)

Context of citations to this paper:   More

.... can be extended to a model with dynamically changing membership and members with incomplete views, using methodologies similar to [10]. Members may su#er crash (non Byzantine) failures, and recover subsequently. Unlike other papers on failure detectors (e.g. 14] that...

...and message and time complexity of a round of our protocol. Detailed discussions and proofs of the results are available in [10]. Let N be the number of group members at the start of the election round we will assume that this value is approximately known to all...

Cited by:   More
Understanding and Mitigating the Effects of Denial-of-Service.. - Sasson   (Correct)
Probabilistic Atomic Broadcast - Pascal Felber Fernando (2002)   (Correct)
A Probabilistically Correct Leader Election Protocol for .. - Gupta, van Renesse.. (2000)   (Correct)

Active bibliography (related documents):   More   All
0.6:   Optimal Elections in Faulty Loop Networks and Applications - Mans, Santoro (1998)   (Correct)
0.4:   Impossibility of Black-Box Reduction from Non-Adaptively to.. - Dodis (2000)   (Correct)
0.2:   Automatic Code Placement Alternatives for Ad-Hoc and.. - Sirer, Barr, Kim, Fung (2001)   (Correct)

Similar documents based on text:   More   All
1.0:   Scalable Fault-Tolerant Aggregation in Large Process Groups - Gupta, van Renesse, Birman (2001)   (Correct)
0.6:   Horus: A Flexible Group Communications System - van Renesse, Birman, Glade.. (1996)   (Correct)
0.6:   A Framework for Protocol Composition in Horus - van Renesse, Birman.. (1995)   (Correct)

Related documents from co-citation:   More   All
5:   A gossip-style failure detection service - van Renesse, Minsky et al. - 1998
3:   Directional gossip: gossip in a wide area network - Lin, Marzullo
3:   Impossibility of distributed consensus with one faulty process (context) - Fischer, Lynch et al. - 1985

BibTeX entry:   (Update)

I. Gupta, R. van Renesse, and K. P. Birman. A probabilistically correct leader election protocol for large groups. In Proceedings of 14th International Symposium on Distributed Computing (DISC http://citeseer.ist.psu.edu/533005.html   More

@inproceedings{ gupta00probabilistically,
    author = "Indranil Gupta and Robbert van Renesse and Kenneth P. Birman",
    title = "A Probabilistically Correct Leader Election Protocol for Large Groups",
    booktitle = "International Symposium on Distributed Computing",
    pages = "89--103",
    year = "2000",
    url = "citeseer.ist.psu.edu/533005.html" }
Citations (may not include all citations):
739   Impossibility of distributed consensus with one faulty proce.. (context) - Fischer, Lynch et al. - 1985
153   the minimal synchronism needed for distributed consensus (context) - Dolev, Dwork et al. - 1987
134   A distributed algorithm for minimum weight spanning trees (context) - Gallager, Humblet et al. - 1983
81   Unreliable failure detectors for asynchronous systems (context) - Chandra, Toueg - 1991
73   Randomized Byzantine generals (context) - Rabin - 1983
72   A gossipstyle failure detection service - van Renesse, Minsky et al. - 1998
62   Bimodal multicast - Birman, Hayden et al. - 1999
57   Randomization in Byzantine agreement (context) - Chor, Dwork - 1989
29   Optimal distributed algorithms for minimum weight spanning t.. (context) - Awerbuch - 1987
21   View synchronous communication in large scale networks - Malloth, Schiper - 1995
20   Memory space requirements for self-stabilizing leader electi.. - Beauquier, Gradinariu et al. - 1999
20   Randomized Byzantine agreements (context) - Toueg - 1984
18   Leader election in complete networks - Singh - 1997
15   Design and analysis of dynamic leader election protocols in .. - Brunekreef, Katoen et al. - 1997
14   McGraw-Hill International Edition (context) - Papoulis, Random et al. - 1991
11   Revisiting the Paxos algorithm - De Prisco, Lampson et al.
10   Fast perfect-information leader-election protocol with linea.. (context) - Cooper, Linial - 1993
9   Random graphs of small order (context) - Bollobas, Thomason - 1983
7   Propagation and leader election in a multihop broadcast envi.. - Cidon, Mokryn - 1998
7   Randomness-optimal sampling, extractors, and constructive le.. (context) - Zuckerman
7   Time optimal leader election in general networks (context) - Peleg - 1990
6   Election vs. consensus in asynchronous systems - Sabel, Marzullo - 1995
6   Leader election in the presence of link failures - Singh - 1994
5   Electing good leaders (context) - Singh, Kurose - 1994
5   A highly available local leader election service - Fetzer, Cristian - 1999
3   Simple and e#cient leader election in the full information m.. (context) - Ostrovsky, Rajagopalan et al. - 1994
2   the computational power needed to elect a leader (context) - Itai - 1991
2   E#cient bu#ering in reliable multicast protocols (context) - Ozkasap, van Renesse et al. - 1999
2   Leader election in the presence of n-1 initial failures (context) - Taubenfeld - 1989
2   Reliable election in broadcast networks (context) - King, Gendreau et al. - 1989
2   A distributed election protocol for unreliable networks (context) - Kim, Belford - 1996
1   Computing on anonymous networks. 1. Characterizing the solva.. (context) - Yamashita, Kameda - 1996



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.cornell.edu/gupta/professional_information.htm):   More
On Scalable and Efficient Distributed Failure Detectors - Gupta, Chandra, Goldszmidt (2001)   (Correct)
Holistic Operations in Large-scale Sensor Network Systems: a.. - Gupta, Birman   (Correct)
SWIM: Scalable Weakly-consistent Infection-style Process.. - Das, Gupta, Motivala (2002)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC