The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Unreliable failure detectors for reliable distributed systems
Open accessAbstract
We introduce the concept of unreliable failure detectors and study how they can be used to solve Consensus in asynchronous systems with crash failures. We characterise unreliable failure detectors in terms of two properties—completeness and accuracy. We show that Consensus can be solved even with unreliable failure detectors that make an infinite number of mistakes, and determine which ones can be used to solve Consensus despite any number of crashes, and which ones require a majority of correct processes. We prove that Consensus and Atomic Broadcast are reducible to each other in asynchronous systems with crash failures; thus, the above results also apply to Atomic Broadcast. A companion paper shows that one of the failure detectors introduced here is the weakest failure detector for solving Consensus [Chandra et al. 1992].
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
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 · cited 1×
“LAMPORT, L., SHOSTAK,R., AND PEASE, M. 1982.”
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
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
Reaching Agreement in the Presence of Faults
Pease, M., Shostak, R., & Lamport, L. (1980) · Journal of the ACM · doi:10.1145/322186.322188 · Cited by 2,359
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
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
Knowledge and common knowledge in a distributed environment
Halpern, J. Y., & Moses, Y. (1990) · Journal of the ACM · doi:10.1145/79147.79161 · Cited by 955
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
SIFT: Design and analysis of a fault-tolerant computer for aircraft control
Wensley, J. H., Lamport, L., Goldberg, J., Green, M. W., Levitt, K. N., Melliar-Smith, P. M., Shostak, R. E., & Weinstock, C. B. (1978) · Proceedings of the IEEE · doi:10.1109/proc.1978.11114 · Cited by 568
Cited by
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
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
Saito, Y., & Shapiro, M. (2005) · ACM Computing Surveys · doi:10.1145/1057977.1057980 · Cited by 739
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
UbiCrawler: a scalable fully distributed Web crawler
Boldi, P., Codenotti, B., Santini, M., & Vigna, S. (2004) · Software: Practice and Experience · doi:10.1002/spe.587 · Cited by 560
Total order broadcast and multicast algorithms: Taxonomy and survey
Défago, X., Schiper, A., & Urbán, P. (2004) · ACM Computing Surveys · doi:10.1145/1041680.1041682 · Cited by 543
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
Secure and Efficient Asynchronous Broadcast Protocols
Cachin, C., Kursawe, K., Petzold, F., & Shoup, V. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_31 · Cited by 371
There is more consensus in Egalitarian parliaments
Moraru, I., Andersen, D. G., & Kaminsky, M. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2517350 · Cited by 362
On the quality of service of failure detectors
Chen, W., Toueg, S., & Aguilera, M. K. (2002) · IEEE Transactions on Computers · doi:10.1109/12.980014 · Cited by 361
Self-citationFundamentals of fault-tolerant distributed computing in asynchronous environments
Gärtner, F. C. (1999) · ACM Computing Surveys · doi:10.1145/311531.311532 · Cited by 346
PeerReview: practical accountability for distributed systems
Haeberlen, A., Kouznetsov, P., & Druschel, P. (2007) · Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles · doi:10.1145/1294261.1294279 · Cited by 337
Shakeri, R., Al-Garadi, M. A., Badawy, A., Mohamed, A., Khattab, T., Al-Ali, A. K., Harras, K. A., & Guizani, M. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2924143 · Cited by 295
Zang, X., Chen, W., Zou, J., Zhou, S., Lisong, H., & Ruigang, L. (2018) · 2018 2nd IEEE Conference on Energy Internet and Energy System Integration (EI2) · doi:10.1109/ei2.2018.8582217 · Cited by 7
“Therefore, the following parameters are defined, as shown in Table III: In Table III, both TC and TA contain TA-D and TN-D, all TA, TA-D and TN-D should be big enough to avoid misjudging the detected microservice as failure under normal conditions, and TC should be small enough, so in order to balance K, the expressio…”
(2010) · reroDoc Digital Library · Cited by 2
Heartbeat-Bound Hierarchical Credentials: Cryptographic Revocation for AI Agent Swarms
Deochake, S. (2026) · arXiv · doi:10.48550/arxiv.2605.20704
Metadata
- Authors
- Chandra, T. D., & Toueg, S.
- Venue
- Journal of the ACM
- Published
- 1996-03
- Volume
- 43
- Issue
- 2
- Pages
- 225-267
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2133943294
- Cited by
- 2,513
- References
- 28
- FWCI
- 69.56
- Type
- journal article
- Language
- en
- Open access
- bronze
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.