Encyclopedia of Algorithms

2016 Edition
| Editors: Ming-Yang Kao

Atomic Broadcast

  • Xavier Défago
Reference work entry
DOI: https://doi.org/10.1007/978-1-4939-2864-4_37

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...

Keywords

Atomic multicast Total order broadcast Total order multicast 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Carr R (1985) The Tandem global update protocol. Tandem Syst Rev 1:74–85Google Scholar
  2. 2.
    Chandra TD, Toueg S (1996) Unreliable failure detectors for reliable distributed systems. J ACM 43:225–267MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Chang J-M, Maxemchuk NF (1984) Reliable broadcast protocols. ACM Trans Comput Syst 2:251–273CrossRefGoogle Scholar
  4. 4.
    Chockler G, Keidar I, Vitenberg R (2001) Group communication specifications: a comprehensive study. ACM Comput Surv 33:427–469CrossRefGoogle Scholar
  5. 5.
    Cristian F (1990) Synchronous atomic broadcast for redundant broadcast channels. Real-Time Syst 2:195–212CrossRefGoogle Scholar
  6. 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
  7. 7.
    Cristian F, Aghili H, Strong R, Dolev D (1995) Atomic broadcast: from simple message diffusion to Byzantine agreement. Inform Comput 118:158–179MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Défago X, Schiper A, Urbán P (2004) Total order broadcast and multicast algorithms: taxonomy and survey. ACM Comput Surv 36:372–421CrossRefGoogle Scholar
  9. 9.
    Fischer MJ, Lynch NA, Paterson MS (1985) Impossibility of distributed consensus with one faulty process. J ACM 32:374–382MathSciNetzbMATHCrossRefGoogle Scholar
  10. 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
  11. 11.
    Lamport L (1978) Time, clocks, and the ordering of events in a distributed system. Commun ACM 21:558–565zbMATHCrossRefGoogle Scholar
  12. 12.
    Lamport L, Shostak R, Pease M (1982) The Byzantine generals problem. ACM Trans Prog Lang Syst 4:382–401zbMATHCrossRefGoogle Scholar
  13. 13.
    Schneider FB (1990) Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput Surv 22:299–319CrossRefGoogle Scholar
  14. 14.
    Segall A (1983) Distributed network protocols. IEEE Trans Inf Theory 29:23–35MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Wiesmann M, Schiper A (2005) Comparison of database replication techniques based on total order broadcast. IEEE Trans Knowl Data Eng 17:551– 566CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Xavier Défago
    • 1
  1. 1.School of Information ScienceJapan Advanced Institute of Science and Technology (JAIST)IshikawaJapan