Raft论文翻译(5.4)——安全性

5.4 Safety

5.4 安全性

The previous sections described how Raft elects leaders and replicates log entries. However, the mechanisms described so far are not quite sufficient to ensure that each state machine executes exactly the same commands in the same order. For example, a follower might be unavailable while the leader commits several log entries, then it could be elected leader and overwrite these entries with new ones; as a result, different state machines might execute different command sequences.

前面的部分描述了 Raft 如何选举领导者和复制日志条目。然而，到目前为止所描述的机制还不足以确保每个状态机以相同的顺序执行完全相同的命令。例如，当领导者提交多个日志条目时，follower 可能不可用，然后它可以被选为领导者并用新的条目覆盖这些条目；因此，不同的状态机可能会执行不同的命令序列。

This section completes the Raft algorithm by adding a restriction on which servers may be elected leader. The restriction ensures that the leader for any given term contains all of the entries committed in previous terms (the Leader Completeness Property from Figure 3). Given the election restriction, we then make the rules for commitment more precise. Finally, we present a proof sketch for the Leader Completeness Property and show how it leads to correct behavior of the replicated state machine.

这一章  完成 Raft 算法：增加限制到：  哪些 server 可能被选为 leader。

限制确保：任意给定的 term 的 leader 包含所有之前 term 已经提交的元素（图 3）

根据选举限制，我们使得 规则更加准确。

我们给出一个 leader 完整性的 图 并展示他如何纠正状态机的行为。