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

The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.

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
Open this paper in CoChat — free account

Abstract

In loosely coupled distributed systems subject to random communication delays and component failures, atomic brocrdcart protocols can be used to implement the abstraction of a A-common sfomge, a replicated storage that displays at any clock time the same contents to every correct processor and that requires A time units to complete replicated updates. We term a broadcast protocol atomic if (1) it delivers every message broadcast by a correct sender to all correct receivers within some known time bound (ferminution), (2) it ensures that every message whose broadcast is initiated by a sender is either delivered to all correct receivers or to none of them (ofomicify), and (3) it guarantees that all delivered messages from all senders are delivered in the same order at all receiving nodes (order). This paper presents a famib of atomic broadcast protocols that are tolerant of increasingly general fault classes: ommm fuulfs, which cause a component (processor or communication link) never to deliver a requested service, riming fuulfs, which cause a component to deliver a requested service either too early or too late, and Byanfine fuults, which lead to the delivery of a service other 'than the one requested. The protocols work for arbitrary point-to-point network topologies, can tolerate any number of faults up to network partitioning, use a small number of messages, and achieve in many wes the best possible termination times.

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.1109/ftcsh.1995.532668

Cites

12 of 12 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 12 references

Cited by

See all 353

Metadata

Authors
Cristian, F., Aghili, H., Strong, R., & Volev, D.
Venue
Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'.
Publisher
IEEE
Published
2005-08-24
Pages
431
DOI
10.1109/ftcsh.1995.532668
OpenAlex
W2102526983
Cited by
353
References
12
FWCI
8.08
Type
conference paper
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: ATOMIC BROADCAST: FROM SIMPLE MESSAGE DIFFUSION TO BYZANTINE AGREEMENT. https://app.cochat.ai/papers/10.1109/ftcsh.1995.532668
The paper
Cristian, F., Aghili, H., Strong, R., & Volev, D. (2005). ATOMIC BROADCAST: FROM SIMPLE MESSAGE DIFFUSION TO BYZANTINE AGREEMENT. Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'. https://doi.org/10.1109/ftcsh.1995.532668

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.