Raft算法论文翻译，持续更新

In Search of an Understandable Consensus Algorithm (Extended Version)

Diego Ongaro and John Ousterhout

Stanford University

 

寻找一种可理解的共识算法(扩展版)

Diego Ongaro 和 John Ousterhout

斯坦福大学

 

Abstract

Raft is a consensus algorithm for managing a replicated log.

It produces a result equivalent to (multi-)Paxos, and it is as efficient as Paxos, but its structure is different from Paxos;

this makes Raft more understandable than Paxos and also provides a better foundation for building practical systems.

In order to enhance understandability, Raft separates the key elements of consensus, such as leader election, log replication, and safety,

and it enforces a stronger degree of coherency to reduce the number of states that must be considered.

Results from a user study demonstrate that Raft is easier for students to learn than Paxos.

Raft also includes a new mechanism for changing the cluster membership, which uses overlapping majorities to guarantee safety.

 

摘要 

Raft是一个用于管理复制日志的共识算法。

它产生与multi-Paxos相同的结果，并且与Paxos一样高效，但其结构与Paxos不同。
这使得Raft比Paxos更通俗易懂，并对构建实际的系统提供了更好的基础。
为了提高可理解性，Raft将共识的关键要素分离，诸如leader选举，日志复制和安全，

并且加强了一致性以减少必须考虑到的状态。
用户调研结果表明Raft比Paxos更容易让学生学习。
Raft还包含一种用于更改集群成员的新机制，该机制使用重叠的多数来保证安全。