Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement

@article{Cristian1995AtomicBF,
  title={Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement},
  author={F. Cristian and H. Aghili and H. R. Strong and D. Dolev},
  journal={Inf. Comput.},
  year={1995},
  volume={118},
  pages={158-179}
}
  • F. Cristian, H. Aghili, +1 author D. Dolev
  • Published 1995
  • Computer Science
  • Inf. Comput.
  • In distributed systems subject to random communication delays and component failures, atomic broadcast can be used to implement the abstraction of synchronous replicated storage, a distributed storage that displays the same contents at every correct processor as of any clock time. This paper presents a systematic derivation of a family of atomic broadcast protocols that are tolerant of increasingly general failure classes: omission failures, timing failures, and authentication-detectable… CONTINUE READING
    366 Citations
    A performance comparison of asynchronous atomic broadcast protocols
    • 52
    A lightweight solution to uniform atomic broadcast for asynchronous systems
    • E. Anceaume
    • Computer Science
    • Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing
    • 1997
    • 26
    Node-Initiated Byzantine Consensus Without a Common Clock
    • PDF
    Optimistic Atomic Multicast
    • 7
    • PDF
    Reliable broadcasts and communication models: tradeoffs and lower bounds
    • 11
    • PDF
    Early-Delivery Dynamic Atomic Broadcast
    • 30
    • PDF
    Early-Delivery Dynamic Atomic Broadcast (Extended Abstract)
    • PDF
    Improved fault tolerant broadcasts in CAN
    • L. Pinho, F. Vasques
    • Engineering, Computer Science
    • ETFA 2001. 8th International Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.01TH8597)
    • 2001
    • 5
    • PDF
    On the Semantics of Group Communication
    • 4

    References

    SHOWING 1-10 OF 66 REFERENCES
    New latency bounds for atomic broadcast
    • 18
    Agreeing on who is present and who is absent in a synchronous distributed system
    • F. Cristian
    • Computer Science
    • [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers
    • 1988
    • 110
    • PDF
    Unreliable failure detectors for reliable distributed systems
    • 2,773
    • PDF
    Fault-tolerant clock synchronization
    • 194
    • PDF
    Reliable communication in the presence of failures
    • 1,145
    • PDF
    Understanding Protocols for Byzantine Clock Synchronization
    • 173
    • PDF
    Authenticated Algorithms for Byzantine Agreement
    • 503
    • PDF
    Reliable broadcast protocols
    • 779
    • PDF