ESCAPE预防领导者失误
ESCAPE to Precaution against Leader Failures
摘要：
基于领导者的共识协议必须经历一个观点改变阶段，以在当前领导者失败时选举新的领导者。新的领导者通常是在从法定数量的服务器收集选票的候选服务器上决定的。然而，基于投票的选举机制在每个候选人只获得部分选票时，本质上会导致领导候选人资格的竞争。这种分裂投票的情况可能会导致没有领导权的赢家，并延长不受欢迎的观点转变期。在本文中，我们调查了一个案例研究筏的领导人选举机制，并提出了一个新的领导人选举协议，称为ESCAPE，从根本上解决了分裂票的优先级服务器的基础上，他们的日志响应。ESCAPE通过Raft的周期性心跳动态地分配具有不同优先级的配置的服务器。在每次分配中，ESCAPE跟踪服务器日志响应，并将倾向于赢得选举的配置分配给更新的服务器，从而准备一个优先级较高的候选者池。因此，在下一次选举时，具有最高优先权的候选人将击败其对手，成为下一任领导人，没有竞争。实验结果表明，ESCAPE算法随着簇规模的扩大，逐步减少了簇首选举时间，在消息丢失的情况下，这种改进更加显著。
英文摘要：
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 responsiveness and assigns configurations that are inclined to win an election to more up-to-date servers, thereby preparing a pool of prioritized candidates. Consequently, when the next election takes place, the candidate with the highest priority will defeat its counterparts and becomes the next leader without competition. The evaluation results show that ESCAPE progressively reduces the leader election time when the cluster scales up, and the improvement becomes more significant under message loss.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
