000142724 001__ 142724
000142724 005__ 20190416220645.0
000142724 037__ $$aREP_WORK
000142724 245__ $$aGeneric construction of consensus algorithms for benign and Byzantine faults
000142724 269__ $$a2009
000142724 260__ $$c2009
000142724 336__ $$aReports
000142724 520__ $$aThe 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.
000142724 700__ $$aRütti, Olivier
000142724 700__ $$0243466$$aMilosevic, Zarko$$g173713
000142724 700__ $$0241767$$aSchiper, André$$g106377
000142724 8564_ $$s309336$$uhttps://infoscience.epfl.ch/record/142724/files/bcc-paper_2.pdf$$zn/a
000142724 909C0 $$0252206$$pLSR$$xU10411
000142724 909CO $$ooai:infoscience.tind.io:142724$$pIC$$preport$$qGLOBAL_SET
000142724 917Z8 $$x173713
000142724 917Z8 $$x173713
000142724 937__ $$aLSR-REPORT-2009-005
000142724 973__ $$aEPFL$$sPUBLISHED
000142724 980__ $$aREPORT