ACM Transactions on Computer Systems (TOCS)
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
On implementing omega with weak reliability and synchrony assumptions
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Brief announcement: chasing the weakest system model for implementing Ω and consensus
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Ω meets paxos: leader election and stability without eventual timely links
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Leader election for replicated services using application scores
Middleware'11 Proceedings of the 12th ACM/IFIP/USENIX international conference on Middleware
Leader election for replicated services using application scores
Proceedings of the 12th International Middleware Conference
| Hi-index | 0.00 |
Experimental studies have shown that electing a leader based on measurements of the underlying communication network can be beneficial. We use this approach to study the problem of electing a leader that is eventually not only correct (as captured by the Ω failure detector abstraction), but also optimal with respect to the transmission delays to its peers. We give the definitions of this problem and a suitable model, thus allowing us to make an analytical analysis of the problem, which is in contrast to previous work on that topic.