Keywords and Synonyms
Atomic multicast; Total order broadcast ; Total order multicast
The problem is concerned with allowing a set of processes to concurrently broadcast messages while ensuring that all destinations consistently deliver them in the exact same sequence, in spite of the possible presence of a number of faulty processes.
The work of Cristian, Aghili, Strong, and Dolev  considers the problem of atomic broadcast in a system with approximately synchronized clocks and bounded transmission and processing delays. They present successive extensions of an algorithm to tolerate a bounded number of omission, timing, or Byzantine failures, respectively.
The work presented in this entry originally appeared as a widely distributed conference contribution , over a decade before being published in a journal , at which time the work was well-known in the research community. Since there was no significant change in the algorithms,...
- 1.Carr, R.: The Tandem global update protocol. Tandem Syst. Rev. 1, 74–85 (1985)Google Scholar
- 6.Cristian, F., Aghili, H., Strong, R., Dolev, D.: Atomic Broadcast: From simple message diffusion to Byzantine agreement. In: Proc. 15th Intl. Symp. on Fault-Tolerant Computing (FTCS-15), Ann Arbor, June 1985 pp. 200–206. IEEE Computer Society PressGoogle Scholar
- 10.Hadzilacos, V., Toueg, S.: Fault-tolerant broadcasts and related problems. In: Mullender, S. (ed.) Distributed Systems, 2nd edn., pp. 97–146. ACM Press Books, Addison-Wesley (1993). Extended version appeared as Cornell Univ. TR 94-1425Google Scholar