| Título: | A Probabilistically Correct Leader Election Protocol for Large Groups |
| Autores: |
Gupta, Indranil van Renesse, Robbert Birman, Kenneth P. |
| Fecha: |
2007-04-09 2007-04-09 2000-04-17 |
| Publicador: | Cornell University |
| Fuente: |
Ver documento Ver documento |
| Tipo: | Technical Report |
| Tema: |
computer science technical report |
| Descripción: | 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 independent of group size. After formally specifying the probabilistic properties, we describe the protocol in detail. Our subsequent mathematical analysis provides probabilistic bounds on the complexity of the protocol. Finally, the results of simulation show that the performance of the protocol is satisfactory. |
| Idioma: | Inglés |
1 Dance in the Noh Theater, Volume 1: Dance Analysis por Bethe, Monica,Brazell, Karen | 6 Rationality and Reason Today por Welsch, Wolfgang |
2 Dance in the Noh Theater, Volume 3: Dance Patterns por Bethe, Monica,Brazell, Karen | 7 Reason: traditional and contemporary, or Why should we still speak of reason at all? por Welsch, Wolfgang |
3 Archives or Assets? por Hirtle, Peter B. | 8 High Precision Lattice QCD: Perturbations in a Non-Perturbative World por Mason, Quentin |
4 Digital Preservation and Copyright por Hirtle, Peter B. | 9 Unpublished Materials, New Technologies, and Copyright: Facilitating Scholarly Use por Hirtle, Peter B. |
5 Reason and Transition: On the Concept of Transversal Reason por Welsch, Wolfgang | 10 |