Rütti, OlivierMilosevic, ZarkoSchiper, André2010-03-012010-03-012010-03-01201010.1109/DSN.2010.5544299https://infoscience.epfl.ch/handle/20.500.14299/47768WOS:000287078300036The paper proposes a generic consensus algorithm that highlights the basic and common features of known consensus algorithms. The parameters of the generic algorithm encapsulate the core differences between various consensus algorithms, including leader-based and leader-free algorithms, addressing benign faults, authenticated Byzantine faults and Byzantine faults. This leads to the identification of three classes of consensus algorithms. With the proposed classification, Paxos and PBFT indeed belong to the same class, while FaB Paxos belongs to a different class. Interestingly, the classification allowed us to identify a new Byzantine consensus algorithm that requires n>4b, where b is the maximum number of Byzantine processes.Distributed AlgorithmsConsensusByzantine FaultsModularityUnification.text::conference output::conference proceedings::conference paper