Latency-aware Leader Election

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 aptured 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.


Published in:
Proceedings of the 2009 ACM symposium on Applied Computing, 1056-1061
Presented at:
SAC 2009 - Dependable and Adaptive Distributed Systems (DADS 09) track, Honolulu, Hawaii, March 10, 2009
Year:
2009
Publisher:
New York, NY, USA , ACM
Keywords:
Laboratories:




 Record created 2010-01-21, last modified 2018-03-17

n/a:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)