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 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… (More)
DOI: 10.1007/3-540-40026-5_6


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics