Years and Authors of Summarized Original Work
1995; Cristian, Aghili, Strong, Dolev
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, the historical...
KeywordsAtomic multicast Total order broadcast Total order multicast
- 1.Carr R (1985) The Tandem global update protocol. Tandem Syst Rev 1:74–85Google Scholar
- 6.Cristian F, Aghili H, Strong R, Dolev D (1985) Atomic broadcast: from simple message diffusion to Byzantine agreement. In: Proceedings of the 15th international symposium on fault-tolerant computing (FTCS-15), Ann Arbor, June 1985. IEEE Computer Society Press, pp 200—206Google Scholar
- 10.Hadzilacos V, Toueg S (1993) Fault-tolerant broadcasts and related problems. In: Mullender S (ed) Distributed systems, 2nd edn. ACM Press Books/Addison-Wesley, pp 97–146, Extended version appeared as Cornell Univ. TR 94-1425Google Scholar