The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
On the quality of service of failure detectors
Abstract
We study the quality of service (QoS) of failure detectors. By QoS, we mean a specification that quantifies: (1) how fast the failure detector detects actual failures and (2) how well it avoids false detections. We first propose a set of QoS metrics to specify failure detectors for systems with probabilistic behaviors, i.e., for systems where message delays and message losses follow some probability distributions. We then give a new failure detector algorithm and analyze its QoS in terms of the proposed metrics. We show that, among a large class of failure detectors, the new algorithm is optimal with respect to some of these QoS metrics. Given a set of failure detector QoS requirements, we show how to compute the parameters of our algorithm so that it satisfies these requirements and we show how this can be done even if the probabilistic behavior of the system is not known. We then present some simulation results that show that the new failure detector algorithm provides a better QoS than an algorithm that is commonly used in practice. Finally, we suggest some ways to make our failure detector adaptive to changes in the probabilistic behavior of the network.
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
PE, & Billingsley, P. (1996) · Journal of the American Statistical Association · doi:10.2307/2291440 · Cited by 6,481
Ross, S. M. (1982) · Cited by 3,812
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
Self-citationRequirements for Internet Hosts - Communication Layers
(1989) · doi:10.17487/rfc1122 · Cited by 1,370
Probability, Statistics, and Queueing Theory with Computer Science Applications
Baxter, L. A., & Allen, A. O. (1992) · Technometrics · doi:10.2307/1269262 · Cited by 633
Probabilistic clock synchronization
Cristian, F. (1989) · Distributed Computing · doi:10.1007/bf01784024 · Cited by 595
A Gossip-Style Failure Detection Service
van Renesse, R., Minsky, Y., & Hayden, M. (1998) · Middleware’98 · doi:10.1007/978-1-4471-1283-9_4 · Cited by 496
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
Choices: An Introduction to Decision Theory.
Eells, E., & Resnik, M. D. (1990) · The Philosophical Review · doi:10.2307/2185496 · Cited by 340
Probabilistic clock synchronization in distributed systems
Arvind, K. (1994) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.282558 · Cited by 153
Cited by
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
Self-citation
Metadata
- Authors
- Chen, W., Toueg, S., & Aguilera, M. K.
- Venue
- IEEE Transactions on Computers
- Published
- 2002
- Volume
- 51
- Issue
- 1
- Pages
- 13-32
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2124617909
- Cited by
- 361
- References
- 11
- FWCI
- 29.54
- 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.