Years and Authors of Summarized Original Work
1995; Cristian, Aghili, Strong, Dolev
Problem Definition
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 [7] 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.
Related Work
The work presented in this entry originally appeared as a widely distributed conference contribution [6], over a decade before being published in a journal [7], at which time the work was well-known in the research community. Since there was no significant change in the algorithms, the historical...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Carr R (1985) The Tandem global update protocol. Tandem Syst Rev 1:74–85
Chandra TD, Toueg S (1996) Unreliable failure detectors for reliable distributed systems. J ACM 43:225–267
Chang J-M, Maxemchuk NF (1984) Reliable broadcast protocols. ACM Trans Comput Syst 2:251–273
Chockler G, Keidar I, Vitenberg R (2001) Group communication specifications: a comprehensive study. ACM Comput Surv 33:427–469
Cristian F (1990) Synchronous atomic broadcast for redundant broadcast channels. Real-Time Syst 2:195–212
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—206
Cristian F, Aghili H, Strong R, Dolev D (1995) Atomic broadcast: from simple message diffusion to Byzantine agreement. Inform Comput 118:158–179
Défago X, Schiper A, Urbán P (2004) Total order broadcast and multicast algorithms: taxonomy and survey. ACM Comput Surv 36:372–421
Fischer MJ, Lynch NA, Paterson MS (1985) Impossibility of distributed consensus with one faulty process. J ACM 32:374–382
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-1425
Lamport L (1978) Time, clocks, and the ordering of events in a distributed system. Commun ACM 21:558–565
Lamport L, Shostak R, Pease M (1982) The Byzantine generals problem. ACM Trans Prog Lang Syst 4:382–401
Schneider FB (1990) Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput Surv 22:299–319
Segall A (1983) Distributed network protocols. IEEE Trans Inf Theory 29:23–35
Wiesmann M, Schiper A (2005) Comparison of database replication techniques based on total order broadcast. IEEE Trans Knowl Data Eng 17:551– 566
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Défago, X. (2016). Atomic Broadcast. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_37
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_37
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering