【Author】 Xu, Jinjie; Wang, Wei; Zeng, Yu; Yan, Zhiwei; Li, Hongtao
【Source】SYMMETRY-BASEL
【Abstract】Raft is a fast, scalable, understandable consensus algorithm widely used in distributed systems. The Leader handles client requests and interacts with other servers to reach a consensus, so a stable, reliable, and powerful Leader is crucial for the cluster. We designed a policy-based voting mechanism to make the elected Leader as reliable as possible. In order to improve the asymmetric relationship between the Followers and Leader, we designed a mechanism to trigger a new round of the election actively so that the Leader node can actively transform into a Follower under certain conditions and enhance the symmetry between servers. Our proposed Raft-PLUS algorithm makes the elected Leader as reliable as possible through four election policies and designed three opposition policies to trigger a new round of the election. To verify the effectiveness of the Raft-PLUS algorithm, we configure different election and opposition policies on 12 servers to simulate the election and opposition process of the Leader and explain the process. To demonstrate the advantages of the Raft-PLUS algorithm, we built key-value stores based on Raft and Raft-PLUS, and we tested the performance of Raft-PLUS and the Raft algorithm in normal and abnormal states. Experimental results show that the Raft-PLUS algorithm has similar write throughput to the Raft algorithm under normal conditions. Regarding the quality of the Leader network changes, the average write throughput of the Raft-PLUS algorithm is 40% higher than that of the Raft algorithm. The Leader's CPU usage fluctuated; the average write throughput of Raft-PLUS was 38% higher than Raft.
【Keywords】blockchain; consensus algorithm; Raft; leader election
【标题】Raft-PLUS:通过基于多策略的无偏见排序的领导者选举改进 Raft
【摘要】Raft 是一种快速、可扩展、可理解的共识算法,广泛应用于分布式系统中。 Leader 处理客户端请求并与其他服务器交互以达成共识,因此稳定、可靠、强大的 Leader 对集群至关重要。 We designed a policy-based voting mechanism to make the elected Leader as reliable as possible.为了改善Followers和Leader之间的不对称关系,我们设计了一种主动触发新一轮选举的机制,使Leader节点在一定条件下可以主动转变为Follower,增强服务器之间的对称性。 Our proposed Raft-PLUS algorithm makes the elected Leader as reliable as possible through four election policies and designed three opposition policies to trigger a new round of the election.为了验证 Raft-PLUS 算法的有效性,我们在 12 台服务器上配置了不同的选举和反对策略,模拟了 Leader 的选举和反对过程并进行了解释。为了展示 Raft-PLUS 算法的优势,我们基于 Raft 和 Raft-PLUS 构建了 key-value 存储,并测试了 Raft-PLUS 和 Raft 算法在正常和异常状态下的性能。实验结果表明,Raft-PLUS 算法在正常情况下具有与 Raft 算法相似的写入吞吐量。关于Leader网络变化的质量,Raft-PLUS算法的平均写入吞吐量比Raft算法高40%。 Leader的CPU使用率波动; Raft-PLUS 的平均写入吞吐量比 Raft 高 38%。
【关键词】区块链;共识算法;筏;领袖选举
【发表时间】2022
【收录时间】2022-08-23
【文献类型】Article
【论文大主题】共识机制
【论文小主题】RAFT改进
【影响因子】2.940
【翻译者】石东瑛
评论