ESCAPE to Precaution against Leader Failures
Gengrui Zhang, Hans-Arno Jacobsen

TL;DR
ESCAPE is a novel leader election protocol for consensus systems that reduces election time and prevents split votes by prioritizing more up-to-date servers based on log responsiveness, especially under message loss.
Contribution
It introduces ESCAPE, a leader election method that dynamically prioritizes servers to avoid split votes and expedite leader selection in Raft-like protocols.
Findings
ESCAPE significantly reduces leader election time in large clusters.
The protocol performs well under message loss conditions.
Prioritizing up-to-date servers improves election success rate.
Abstract
Leader-based consensus protocols must undergo a view-change phase to elect a new leader when the current leader fails. The new leader is often decided upon a candidate server that collects votes from a quorum of servers. However, voting-based election mechanisms intrinsically cause competition in leadership candidacy when each candidate collects only partial votes. This split-vote scenario can result in no leadership winner and prolong the undesired view-change period. In this paper, we investigate a case study of Raft's leader election mechanism and propose a new leader election protocol, called ESCAPE, that fundamentally solves split votes by prioritizing servers based on their log responsiveness. ESCAPE dynamically assigns servers with a configuration that offers different priorities through Raft's periodic heartbeat. In each assignment, ESCAPE keeps track of server log…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Peer-to-Peer Network Technologies · Service-Oriented Architecture and Web Services
