Skip to Main content Skip to Navigation
Conference papers

Leader Election for Replicated Services Using Application Scores

Abstract : Replicated services often rely on a leader to order client requests and broadcast state updates. In this work, we present POLE, a leader election algorithm that select leaders using application-specific scores. This flexibility given to the application enables the algorithm to tailor leader election according to metrics that are relevant in practical settings and that have been overlooked by existing approaches. Recovery time and request latency are examples of such metrics. To evaluate POLE, we use ZooKeeper, an open-source replicated service used for coordinating Web-scale applications. Our evaluation over realistic wide-area settings shows that application scores can have a significant impact on performance, and that just optimizing the latency of consensus does not translate into lower latency for clients. An important conclusion from our results is that obtaining a general strategy that satisfies a wide range of requirements is difficult, which implies that configurability is indispensable for practical leader election.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, September 28, 2017 - 5:11:07 PM
Last modification on : Thursday, January 7, 2021 - 2:30:03 PM
Long-term archiving on: : Friday, December 29, 2017 - 3:36:42 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Diogo Becker, Flavio Junqueira, Marco Serafini. Leader Election for Replicated Services Using Application Scores. 12th International Middleware Conference (MIDDLEWARE), Dec 2011, Lisbon, Portugal. pp.289-308, ⟨10.1007/978-3-642-25821-3_15⟩. ⟨hal-01597756⟩



Record views


Files downloads