The DOI matches its Crossref record.
Broadcast protocols for distributed systems
Abstract
An innovative approach is presented to the design of fault-tolerant distributed systems that avoids the several rounds of message exchange required by current protocols for consensus agreement. The approach is based on broadcast communication over a local area network, such as an Ethernet or a token ring, and on two novel protocols, the Trans protocol, which provides efficient reliable broadcast communication, and the Total protocol, which with high probability promptly places a total order on messages and achieves distributed agreement even in the presence of fail-stop, omission, timing, and communication faults. Reliable distributed operations, such as locking, update, and commitment, typically require only a single broadcast message rather than the several tens of messages required by current algorithms.>
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
Cited by
A reliable multicast framework for light-weight sessions and application level framing
Floyd, S., Jacobson, V., McCanne, S., Liu, C.-G., & Zhang, L. (1995) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/217382.217470 · Cited by 705
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
UCoin: An Efficient Privacy Preserving Scheme for Cryptocurrencies
Nosouhi, M. R., Yu, S., Sood, K., Grobler, M., Jurdak, R., Dorri, A., & Shen, S. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3130952 · Cited by 32
“We assume that the N peers in the group communicate through a reliable broadcast communication protocol [37], [38].”
BackgroundMethod
Metadata
- Authors
- Melliar-Smith, P. M., Moser, L. E., & Agrawala, V.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 1990
- Volume
- 1
- Issue
- 1
- Pages
- 17-25
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W1981928839
- Cited by
- 249
- References
- 0
- FWCI
- 18.01
- 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.