Nuno Santos
ABSTRACT
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.
- M. K. Aguilera, C. Delporte-Gallet, H. Fauconnier, and S. Toueg. Stable leader election. In Proceedings of the 15th International Conference on Distributed Computing (DISC'01), pages 108--122. Springer-Verlag, 2001. Google Scholar
Digital Library
- M. K. Aguilera, C. Delporte-Gallet, H. Fauconnier, and S. Toueg. On implementing Omega with weak reliability and synchrony assumptions. In Proceeding of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC'03). ACM Press, 2003. Google ScholarDigital Library
- M. K. Aguilera, C. Delporte-Gallet, H. Fauconnier, and S. Toueg. Communication-efficient leader election and consensus with limited link synchrony. In Proceeding of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC'04), pages 328--337, St. John's, Newfoundland, Canada, 2004. ACM Press. Google ScholarDigital Library
- M. Hutle, D. Malkhi, U. Schmid, and L. Zhou. Brief announcement: Chasing the weakest system model for implementing Ω and consensus. In Proceedings of the 8th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS '06), 2006. Google ScholarDigital Library
- L. Lamport. The part-time parliament. ACM Transactions on Computer Systems, 16(2): 133--169, May 1998. Google ScholarDigital Library
- D. Malkhi, F. Oprea, and L. Zhou. Ω meets paxos: Leader election and stability without eventual timely links. In Proceedings of the 19th International Conference on Distributed Computing (DISC'05), pages 199--213, 2005. Google ScholarDigital Library
- L. Sampaio and F. Brasileiro. Adaptive indulgent consensus. In Dependable Systems and Networks (DSN 2005), pages 422--431, Yokohama, Japan, 2005. IEEE Computer Society. Google ScholarDigital Library
- L. Sampaio, R. C. Nunes, F. Brasileiro, and I. Jansch-Pôrto. Efficient and robust adaptive consensus services based on oracles. Journal of the Brazilian Computer Society (JBCS), Special Issue on Dependable Computing (2005), 2005.Google Scholar
- L. M. R. Sampaio, F. V. Brasileiro, W. Cirne, and J. C. A. Figueiredo. How bad are wrong suspicions? towards adaptive distributed protocols. In Dependable Systems and Networks (DSN 2003), pages 551--560, Los Alamitos, CA, USA, 2003. IEEE Computer Society.Google ScholarCross Ref
Index Terms
- Latency-aware leader election
Recommendations
Sublinear bounds for randomized leader election
This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O ( 1 ) rounds and (with high probability) uses only O ( n log 3 / 2 n ) ...
Efficient Leader Election in Complete Networks
PDP '05: Proceedings of the 13th Euromicro Conference on Parallel, Distributed and Network-Based ProcessingLeader election is a fundamental problem in distributed computing and it has been studied assuming various computation models and network topologies. This paper analyzes the algorithms for leader election in complete networks using asynchronous ...
Comments