The DOI matches its Crossref record; 59 of the 59 references it cites were found in a registry or an index.
Total order broadcast and multicast algorithms: Taxonomy and survey
Abstract
Total order broadcast and multicast (also called atomic broadcast/multicast) present an important problem in distributed systems, especially with respect to fault-tolerance. In short, the primitive ensures that messages sent to a set of processes are, in turn, delivered by all those processes in the same total order.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Unreliable failure detectors for reliable distributed systems
Chandra, T. D., & Toueg, S. (1996) · Journal of the ACM · doi:10.1145/226643.226647 · Cited by 2,513
Implementing fault-tolerant services using the state machine approach: a tutorial
Schneider, F. B. (1990) · ACM Computing Surveys · doi:10.1145/98163.98167 · Cited by 2,387
Consensus in the presence of partial synchrony
Dwork, C., Lynch, N., & Stockmeyer, L. (1988) · Journal of the ACM · doi:10.1145/42282.42283 · Cited by 1,909
An Introduction to Input/Output Automata
Lynch, N. A., & Tuttle, M. R. (2026) · Formal Aspects of Computing · doi:10.1145/3788687 · Cited by 1,011
Reliable communication in the presence of failures
Birman, K. P., & Joseph, T. A. (1987) · ACM Transactions on Computer Systems · doi:10.1145/7351.7478 · Cited by 997
Lightweight causal and atomic group multicast
Birman, K., Schiper, A., & Stephenson, P. (1991) · ACM Transactions on Computer Systems · doi:10.1145/128738.128742 · Cited by 956
Self-citationOn interprocess communication: Part I: Basic formalism
Lamport, L. (1986) · Distributed Computing · doi:10.1007/bf01786227 · Cited by 861
Group communication specifications: a comprehensive study
Chockler, G. V., Keidar, I., & Vitenberg, R. (2001) · ACM Computing Surveys · doi:10.1145/503112.503113 · Cited by 630
On the minimal synchronism needed for distributed consensus
Dolev, D., Dwork, C., & Stockmeyer, L. (1987) · Journal of the ACM · doi:10.1145/7531.7533 · Cited by 620
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
Ben-Or, M. (1983) · Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83 · doi:10.1145/800221.806707 · Cited by 590
Rabin, M. O. (1983) · 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) · doi:10.1109/sfcs.1983.48 · Cited by 589
Totem: a fault-tolerant multicast group communication system
Moser, L. E., Melliar-Smith, P. M., Agarwal, D., Budhia, R. K., & Lingley-Papadopoulos, C. A. (1996) · Communications of the ACM · doi:10.1145/227210.227226 · Cited by 406
Transis: a communication subsystem for high availability
Amir, Y., Dolev, D., Kramer, S., & Malki, D. (2003) · IEEE International Symposium on Fault-Tolerant Computing · doi:10.1109/ftcs.1992.243613 · Cited by 360
Lynch, N. (1996) · Cited by 354
ATOMIC BROADCAST: FROM SIMPLE MESSAGE DIFFUSION TO BYZANTINE AGREEMENT
Cristian, F., Aghili, H., Strong, R., & Volev, D. (2005) · Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'. · doi:10.1109/ftcsh.1995.532668 · Cited by 353
Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
Lamport, L. (1984) · ACM Transactions on Programming Languages and Systems · doi:10.1145/2993.2994 · Cited by 335
Preserving and using context information in interprocess communication
Peterson, L. L., Buchholz, N. C., & Schlichting, R. D. (1989) · ACM Transactions on Computer Systems · doi:10.1145/65000.65001 · Cited by 325
The Transis approach to high availability cluster communication
Dolev, D., & Malki, D. (1996) · Communications of the ACM · doi:10.1145/227210.227227 · Cited by 300
Secure agreement protocols: reliable and atomic group multicast in rampart
Reiter, M. K. (1994) · Proceedings of the 2nd ACM Conference on Computer and communications security - CCS '94 · doi:10.1145/191177.191194 · Cited by 289
(2002) · Interlending & Document Supply · doi:10.1108/ilds.2002.12230aab.001 · Cited by 287
The Totem single-ring ordering and membership protocol
Amir, Y., Moser, L. E., Melliar-Smith, P. M., Agarwal, D., & Ciarfella, P. (1995) · ACM Transactions on Computer Systems · doi:10.1145/210223.210224 · Cited by 278
Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols
Ben-Or, M. (2000) · Cited by 272
Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement
Cristian, F., Aghili, H., Strong, R., & Dolev, D. (1995) · Information and Computation · doi:10.1006/inco.1995.1060 · Cited by 244
The implementation of reliable distributed multiprocess systems
Lamport, L. (1978) · Computer Networks (1976) · doi:10.1016/0376-5075(78)90045-4 · Cited by 233
A high performance totally ordered multicast protocol
Whetten, B., Montgomery, T. L., & Kaplan, S. M. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60042-6_3 · Cited by 212
Understanding the limitations of causally and totally ordered communication
Cheriton, D. R., & Skeen, D. (1993) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/168619.168623 · Cited by 204
Newtop: a fault-tolerant group communication protocol
Ezhilchelvan, P., Macedo, R., & Shrivastava, S. K. (2002) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.1995.500032 · Cited by 179
Coyote: a system for constructing fine-grain configurable communication services
Bhatti, N. T., Hiltunen, M. A., Schlichting, R. D., & Chiu, W. (1998) · ACM Transactions on Computer Systems · doi:10.1145/292523.292524 · Cited by 162
Ordered and reliable multicast communication
García-Molina, H., & Spauster, A. (1991) · ACM Transactions on Computer Systems · doi:10.1145/128738.128741 · Cited by 161
Consul: a communication substrate for fault-tolerant distributed programs
Mishra, S., Peterson, L. L., & Schlichting, R. D. (1993) · Distributed Systems Engineering · doi:10.1088/0967-1846/1/2/004 · Cited by 153
Automatically increasing the fault-tolerance of distributed algorithms
Neiger, G., & Toueg, S. (1990) · Journal of Algorithms · doi:10.1016/0196-6774(90)90019-b · Cited by 112
Handling message semantics with Generic Broadcast protocols
Pedone, F., & Schiper, A. (2002) · Distributed Computing · doi:10.1007/s004460100061 · Cited by 105
Self-citationSpecifying and using a partitionable group communication service
Fekete, A. D., Lynch, N., & Shvartsman, A. A. (2001) · ACM Transactions on Computer Systems · doi:10.1145/377769.377776 · Cited by 103
Pedone, F., & Schiper, A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48169-9_7 · Cited by 101
Self-citationDistributing trust with the Rampart toolkit
Reiter, M. K. (1996) · Communications of the ACM · doi:10.1145/227210.227228 · Cited by 88
Replica determinism in distributed real-time systems: A brief survey
Poledna, S. (1994) · Real-Time Systems · doi:10.1007/bf01088629 · Cited by 86
Packing messages as a tool for boosting the performance of total ordering protocols
Friedman, R., & van Renesse, R. (2002) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1109/hpdc.1997.626423 · Cited by 85
Genuine atomic multicast in asynchronous distributed systems
Guerraoui, R., & Schiper, A. (2001) · Theoretical Computer Science · doi:10.1016/s0304-3975(99)00161-9 · Cited by 83
Self-citationPedone, F., & Schiper, A. (1998) · Lecture notes in computer science · doi:10.1007/bfb0056492 · Cited by 80
Self-citationSimulating reliable links with unreliable links in the presence of process crashes
Basu, A., Charron-Bost, B., & Toueg, S. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61769-8_8 · Cited by 79
AMp: a highly parallel atomic multicast protocol
Veríssimo, P., Rodrigues, L., & Baptista, M. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/75247.75256 · Cited by 78
Message ordering in a multicast environment
García-Molina, H., & Spauster, A. (2003) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.1989.37965 · Cited by 68
Reliable group communication in distributed systems
Navaratnam, S., Chanson, S. T., & Neufeld, G. (2003) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/dcs.1988.12546 · Cited by 66
The Totem multiple-ring ordering and topology maintenance protocol
Agarwal, D., Moser, L. E., Melliar-Smith, P. M., & Budhia, R. K. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279228 · Cited by 64
Perfect failure detection in timed asynchronous systems
Fetzer, C. W. (2003) · IEEE Transactions on Computers · doi:10.1109/tc.2003.1176979 · Cited by 63
Early delivery totally ordered multicast in asynchronous environments
Dolev, D., Kramer, S., & Malki, D. (2002) · IEEE International Symposium on Fault-Tolerant Computing · doi:10.1109/ftcs.1993.627357 · Cited by 63
xAMp: a multi-primitive group communications service
Rodrigues, L., & Veríssimo, P. (2003) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/reldis.1992.235136 · Cited by 61
RTCAST: lightweight multicast for real-time process groups
Abdelzaher, T., Shaikh, A., Jahanian, F., & Shin, K. G. (2002) · IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS) · doi:10.1109/rttas.1996.509542 · Cited by 60
Optimistic total order in wide area networks
de Sousa, A. A. S., Pereira, J., Moura, F., & Oliveira, R. (2003) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/reldis.2002.1180188 · Cited by 58
Totally ordered multicast in large-scale systems
Rodrigues, L., Fonseca, H., & Veríssimo, P. (2002) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.1996.507999 · Cited by 57
Aguilera, M. K., Delporte-Gallet, C., Fauconnier, H., & Toueg, S. (2000) · Lecture notes in computer science · doi:10.1007/3-540-40026-5_18 · Cited by 54
Optimistic atomic broadcast: a pragmatic viewpoint
Pedone, F., & Schiper, A. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00397-8 · Cited by 54
Self-citationAn indulgent uniform total order algorithm with optimistic delivery
Vicente, P., & Rodrigues, L. (2003) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/reldis.2002.1180177 · Cited by 52
Backoff protocols for distributed mutual exclusion and ordering
Chockler, G. V., Malkhi, D., & Reiter, M. K. (2002) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/icdsc.2001.918928 · Cited by 50
Minet, P., & Anceaume, E. (1991) · ACM SIGOPS Operating Systems Review · doi:10.1145/122120.122129 · Cited by 6
Cited by
The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication
Vukolić, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-39028-4_9 · Cited by 1,051
“In the standard distributed computing terminology, “consensus finality” follows from a combination of the total order and agreement properties of total order (atomic) broadcast [17], which is the primitive all state-machine replication protocols are built upon (total order broadcast is, in turn, equivalent to consensu…”
A Survey of Distributed Consensus Protocols for Blockchain Networks
Xiao, Y., Zhang, N., Lou, W., & Hou, Y. T. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2969706 · Cited by 841
A survey of autonomic communications
Dobson, S., Denazis, S., Fernández, A., Gaïti, D., Gelenbe, E., Massacci, F., Nixon, P., Saffre, F., Schmidt, N., & Zambonelli, F. (2006) · ACM Transactions on Autonomous and Adaptive Systems · doi:10.1145/1186778.1186782 · Cited by 626
A Vademecum on Blockchain Technologies: When, Which, and How
Belotti, M., Bozic, N., Pujolle, G., & Secci, S. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2928178 · Cited by 498
Zab: High-performance broadcast for primary-backup systems
Junqueira, F. P., Reed, B. C., & Serafini, M. (2011) · 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN) · doi:10.1109/dsn.2011.5958223 · Cited by 323
Metadata
- Authors
- Défago, X., Schiper, A., & Urbán, P.
- Venue
- ACM Computing Surveys
- Published
- 2004-12
- Volume
- 36
- Issue
- 4
- Pages
- 372-421
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2130264930
- Cited by
- 543
- References
- 59
- FWCI
- 32.60
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.