Issue No. 03 - July (1990 vol. 1)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.80156
<p>A general protocol for atomic broadcast in networks is presented. The protocol tolerates loss, duplication, reordering, delay of messages, and network partitioning in an arbitrary network of fail-stop sites (i.e. no Byzantine site behavior is tolerated). The protocol is based on majority-concensus decisions to commit on unique ordering of received broadcast messages. Under normal operating conditions, the protocol requires three phases to complete and approximately 4N/V messages where N is the number of sites. This overhead is distributed among the messages of which the delivery decision is made and the heavier the broadcast message traffic, the lower the overhead per broadcast message becomes. Under abnormal operating conditions, a decentralized termination protocol (also presented) is invoked. A performance analysis of this protocol is presented, showing that this protocol commits with high probability under realistic operating conditions without invoking termination protocol if N is sufficiently large. The protocol retains its efficiency in wide-area networks where broadcast communication media are unavailable.</p>
Index Termsfault-tolerant protocol; atomic broadcast; loss; duplication; reordering; delay of messages; network partitioning; arbitrary network; fail-stop sites; Byzantine site behavior; majority-concensus decisions; decentralized termination protocol; performanceanalysis; fault tolerant computing; performance evaluation; protocols
S. Luan and V. Gligor, "A Fault-Tolerant Protocol for Atomic Broadcast," in IEEE Transactions on Parallel & Distributed Systems, vol. 1, no. , pp. 271-285, 1990.