Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 543

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

Défago, Xavier, Schiper, André, Urbán, Péter·2004·ACM Computing Surveys
DOI 10.1145/1041680.1041682
Open this paper in CoChat — free account

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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/1041680.1041682

Cites

59 of 59 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 59 references

Cited by

See all 543

Metadata

Authors
Défago, X., Schiper, A., & Urbán, P.
Venue
ACM Computing Surveys
Publisher
Association for Computing Machinery (ACM)
Published
2004-12
Volume
36
Issue
4
Pages
372-421
ISSN
  • 0360-0300 (ISSN-L)
  • 1557-7341
DOI
10.1145/1041680.1041682
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Total order broadcast and multicast algorithms: Taxonomy and survey. https://app.cochat.ai/papers/10.1145/1041680.1041682
The paper
Défago, X., Schiper, A., & Urbán, P. (2004). Total order broadcast and multicast algorithms: Taxonomy and survey. ACM Computing Surveys. https://doi.org/10.1145/1041680.1041682

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.