Time and Message Efficient Reliable Broadcasts

This paper describes the first Reliable Broadcast algorithms that are simultaneously efficient in both time and messages. These algorithms tolerate crash and omission failures. Each Reliable Broadcast takes O(f) time and O(fn) messages, where f is the number of processes that actually fail during this broadcast and n is the total number of processes. In other words, each additional process that fails during a broadcast can increase the broadcast time by at most a constant, and the number of messages by at most O(n). The algorithm tolerant of crash failures requires f+2 rounds. The one for general-omission failures requires 2f+3 rounds.

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

[2]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[3]  Cynthia Dwork,et al.  The inherent cost of nonblocking commitment , 1983, PODC '83.

[4]  Richard D. Schlichting,et al.  Fault-Tolerant Broadcasts , 1984, Sci. Comput. Program..

[5]  Kenneth Jay Perry.  Early Stopping Protocols for Fault-Tolerant Distributed Agreement , 1985 .

[6]  Sam Toueg,et al.  An Authenticated Byzantine Generals Algorithm with Early Stopping , 1984 .

[7]  Jo-Mei Chang,et al.  Reliable broadcast protocols , 1984, TOCS.

[8]  D. Dolev,et al.  Bounds on information exchange for Byzantine agreement , 1985, JACM.

[9]  Rüdiger Reischuk,et al.  A New Solution for the Byzantine Generals Problem , 1985, Inf. Control..

[10]  Brian A. Coan,et al.  Transaction commit in a realistic fault model , 1986, PODC '86.

[11]  Vassos Hadzilacos,et al.  On the Relationship Between the Atomic Commitment and Consensus Problems , 1990, Fault-Tolerant Distributed Computing.

[12]  Sam Toueg,et al.  Distributed agreement in the presence of processor and communication faults , 1986, IEEE Transactions on Software Engineering.

[13]  Paul D. Ezhilchelvan,et al.  Early Stopping Algorithms for Distributed Agreement under Fail-Stop, Omission, and Timing Fault-Types , 1987, SRDS.

[14]  Gilbert Andrew Neiger.  Techniques for simplifying the design of distributed systems , 1988 .

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

[16]  Danny Dolev,et al.  Early stopping in Byzantine agreement , 1990, JACM.

[17]  Gil Neiger,et al.  Automatically Increasing the Fault-Tolerance of Distributed Algorithms , 1990, J. Algorithms.

[18]  Joseph Y. Halpern,et al.  Message-optimal protocols for Byzantine Agreement , 1993, Mathematical systems theory.