This paper presents a modular introduction to crash-tolerant and Byzantine-tolerant protocols for reaching consensus that use the method introduced by the Paxos algorithm of Lamport and by the viewstamped replication algorithm of Oki and Liskov. The consensus protocol runs a sequence of epoch abstractions as governed by an epoch-change abstraction. Implementations of epoch and epoch-change that tolerate crash faults yield the consensus algorithm in Paxos and in viewstamped replication. Implementations of epoch and epoch-change that tolerate Byzantine faults yield the consensus algorithm in the PBFT protocol of Castro and Liskov.
By: Christian Cachin
Published in: RZ3754 in 2009
Questions about this service can be mailed to reports@us.ibm.com .
