Total Ordering Algorithms for Asynchronous Byzantine Systems

The Total algorithms are used within asynchronous faulttolerant distributed systems to derive a total order on messages from a causal order provided by an underlying multicast communication protocol. We present several Total algorithms that represent varying compromises between latency to message ordering and resilience to crash and Byzantine faults. The algorithms use a multi-stage voting strategy to achieve agreement on the total order, and depend on the random structure of the causal order to achieve probabilistic termination.

[1]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[2]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[3]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[4]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[5]  Michael O. Rabin,et al.  Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[6]  Fred B. Schneider,et al.  Byzantine generals in action: implementing fail-stop processors , 1984, TOCS.

[7]  Sam Toueg,et al.  Asynchronous consensus and broadcast protocols , 1985, JACM.

[8]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[9]  Sam Toueg,et al.  Fast Distributed Agreement , 1987, SIAM J. Comput..

[10]  Gabriel Bracha,et al.  Asynchronous Byzantine Agreement Protocols , 1987, Inf. Comput..

[11]  Philip M. Thambidurai,et al.  Interactive consistency with multiple failure modes , 1988, Proceedings [1988] Seventh Symposium on Reliable Distributed Systems.

[12]  Sam Toueg,et al.  Reliable Broadcast in Synchronous and Asynchronous Environments (Preliminary Version) , 1989, WDAG.

[13]  Sam Toueg,et al.  Unreliable failure detectors for asynchronous systems (preliminary version) , 1991, PODC '91.

[14]  Dhiraj K. Pradhan,et al.  Consensus With Dual Failure Modes , 1991, IEEE Trans. Parallel Distributed Syst..

[15]  Sam Toueg,et al.  Unreliable Failure Detectors for Asynchronous Systems , 1991 .

[16]  Rida A. Bazzi,et al.  Simulating Crash Failures with Many Faulty Processors (Extended Abstract) , 1992, WDAG.

[17]  Juan A. Garay,et al.  A Continuum of Failure Models for Distributed Computing , 1992, WDAG.

[18]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1992, PODC '92.

[19]  Vivek Agrawala,et al.  Asynchronous Fault-Tolerant Total Ordering Algorithms , 1993, SIAM J. Comput..

[20]  Xiaotie Deng,et al.  Optimal Amortized Distributed Consensus , 1995, Inf. Comput..