On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Leader election in the presence of n-1 initial failures
Information Processing Letters
Time-optimal leader election in general networks
Journal of Parallel and Distributed Computing
Unreliable failure detectors for asynchronous systems (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Journal of Parallel and Distributed Computing
Simple and efficient leader election in the full information model
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Randomness-optimal sampling, extractors, and constructive leader election
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
ACM Transactions on Computer Systems (TOCS)
A Highly Available Local Leader Election Service
IEEE Transactions on Software Engineering
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the Computational Power Needed to Elect a Leader (Extended Abstract)
WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
Revisiting the Paxos Algorithm
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Efficient Buffering in Reliable Multicast Protocols
NGC '99 Proceedings of the First International COST264 Workshop on Networked Group Communication
Randomized Byzantine Agreements
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Election Vs. Consensus in Asynchronous Systems
Election Vs. Consensus in Asynchronous Systems
A Probabilistically Correct Leader Election Protocol for Large Groups
A Probabilistically Correct Leader Election Protocol for Large Groups
Design and analysis of dynamic leader election protocols in broadcast networks
Distributed Computing
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
On scalable and efficient distributed failure detectors
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Failure Detection and Membership Management in Grid Environments
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Aggregation methods for large-scale sensor networks
ACM Transactions on Sensor Networks (TOSN)
Fault tolerant aggregation in heterogeneous sensor networks
Journal of Parallel and Distributed Computing
Cooperative leader election algorithm for master/slave mobile ad hoc networks
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
| Hi-index | 0.01 |
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 constam number of message, 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.