The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Group communication specifications: a comprehensive study
Abstract
View-oriented group communication is an important and widely used building block for many distributed applications. Much current research has been dedicated to specifying the semantics and services of view-oriented group communication systems (GCSs). However, the guarantees of different GCSs are formulated using varying terminologies and modeling techniques, and the specifications vary in their rigor. This makes it difficult to analyze and compare the different systems. This survey provides a comprehensive set of clear and rigorous specifications, which may be combined to represent the guarantees of most existing GCSs. In the light of these specifications, over 30 published GCS specifications are surveyed. Thus, the specifications serve as a unifying framework for the classification, analysis, and comparison of group communication systems. The survey also discusses over a dozen different applications of group communication systems, shedding light on the usefulness of the presented specifications. This survey is aimed at both system builders and theoretical researchers. The specification framework presented in this article will help builders of group communication systems understand and specify their service semantics; the extensive survey will allow them to compare their service to others. Application builders will find a guide here to the services provided by a large variety of GCSs, which could help them choose the GCS appropriate for their needs. The formal framework may provide a basis for interesting theoretical work, for example, analyzing relative strengths of different properties and the costs of implementing them.
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
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
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
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
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
An Introduction to Input/Output Automata
Lynch, N. A., & Tuttle, M. R. (2026) · Formal Aspects of Computing · doi:10.1145/3788687 · Cited by 1,011
Larch: Languages and Tools for Formal Specification
Guttag, J. V., Horning, J. J., Garland, S. J., Jones, K. D., Modet, A., & Wing, J. M. (1993) · Springer eBooks · doi:10.1007/978-1-4612-2704-5 · Cited by 618
Exploiting virtual synchrony in distributed systems
Birman, K., & Joseph, T. (1987) · ACM SIGOPS Operating Systems Review · doi:10.1145/37499.37515 · Cited by 601
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
Distributed process groups in the V Kernel
Cheriton, D. R., & Zwaenepoel, W. (1985) · ACM Transactions on Computer Systems · doi:10.1145/214438.214439 · Cited by 353
Building secure and reliable network applications
Birman, K. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63343-x_35 · Cited by 332
The Transis approach to high availability cluster communication
Dolev, D., & Malki, D. (1996) · Communications of the ACM · doi:10.1145/227210.227227 · Cited by 300
The Totem single-ring ordering and membership protocol
Amir, Y., Moser, L. E., Melliar-Smith, P. M., Agarwal, D., & Ciarfella, P. (1995) · ACM Transactions on Computer Systems · doi:10.1145/210223.210224 · Cited by 278
Exploiting virtual synchrony in distributed systems
Birman, K., & Joseph, T. (1987) · Proceedings of the eleventh ACM Symposium on Operating systems principles - SOSP '87 · doi:10.1145/41457.37515 · Cited by 265
Moser, L. E., Amir, Y., Melliar-Smith, P. M., & Agarwal, D. (2002) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/icdcs.1994.302392 · Cited by 231
A high performance totally ordered multicast protocol
Whetten, B., Montgomery, T. L., & Kaplan, S. M. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60042-6_3 · Cited by 212
Newtop: a fault-tolerant group communication protocol
Ezhilchelvan, P., Macedo, R., & Shrivastava, S. K. (2002) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.1995.500032 · Cited by 179
Using process groups to implement failure detection in asynchronous environments
Ricciardi, A. M., & Birman, K. (1991) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/112600.112628 · Cited by 170
A secure group membership protocol
Reiter, M. K. (1996) · IEEE Transactions on Software Engineering · doi:10.1109/32.481515 · Cited by 156
Consul: a communication substrate for fault-tolerant distributed programs
Mishra, S., Peterson, L. L., & Schlichting, R. D. (1993) · Distributed Systems Engineering · doi:10.1088/0967-1846/1/2/004 · Cited by 153
Specifying and using a partitionable group communication service
Fekete, A. D., Lynch, N., & Shvartsman, A. A. (2001) · ACM Transactions on Computer Systems · doi:10.1145/377769.377776 · Cited by 103
Genuine atomic multicast in asynchronous distributed systems
Guerraoui, R., & Schiper, A. (2001) · Theoretical Computer Science · doi:10.1016/s0304-3975(99)00161-9 · Cited by 83
Membership algorithms for multicast communication groups
Amir, Y., Dolev, D., Kramer, S., & Malki, D. (1992) · Lecture notes in computer science · doi:10.1007/3-540-56188-9_20 · Cited by 82
Group communication in partitionable systems: specification and algorithms
Babaoğlu, Ö., Davoli, R., & Montresor, A. (2001) · IEEE Transactions on Software Engineering · doi:10.1109/32.917522 · Cited by 82
Efficient message ordering in dynamic networks
Keidar, I., & Dolev, D. (1996) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/248052.248062 · Cited by 79
Self-citationUniform reliable multicast in a virtually synchronous environment
Schiper, A., & Sandoz, A. (2002) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.1993.287667 · Cited by 75
A Membership Protocol Based on Partial Order
Mishra, S., Peterson, L., & Schlichting, R. D. (1992) · Dependable computing and fault-tolerant systems · doi:10.1007/978-3-7091-9198-9_15 · Cited by 63
Virtually-synchronous communication based on a weak failure suspector
Schiper, A., & Ricciardi, A. M. (2002) · IEEE International Symposium on Fault-Tolerant Computing · doi:10.1109/ftcs.1993.627356 · Cited by 61
RTCAST: lightweight multicast for real-time process groups
Abdelzaher, T., Shaikh, A., Jahanian, F., & Shin, K. G. (2002) · IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS) · doi:10.1109/rttas.1996.509542 · Cited by 60
Fault-tolerant Total Order Multicast to asynchronous groups
Fritzke, U., Ingels, P., Mostéfaoui, A., & Raynal, M. (2002) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/reldis.1998.740503 · Cited by 56
Totally Ordered Broadcast and Multicast Algorithms: A Comprehensive Survey
Défago, X., Schiper, A., & Urbán, P. (2000) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 42
Cited by
A survey of autonomic communications
Dobson, S., Denazis, S., Fernández, A., Gaïti, D., Gelenbe, E., Massacci, F., Nixon, P., Saffre, F., Schmidt, N., & Zambonelli, F. (2006) · ACM Transactions on Autonomous and Adaptive Systems · doi:10.1145/1186778.1186782 · Cited by 626
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
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
Zab: High-performance broadcast for primary-backup systems
Junqueira, F. P., Reed, B. C., & Serafini, M. (2011) · 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN) · doi:10.1109/dsn.2011.5958223 · Cited by 323
No compromises: distributed transactions with consistency, availability, and performance
Dragojević, A., Narayanan, D., Nightingale, E. B., Renzelmann, M., Shamis, A., Badam, A., & Castro, M. (2015) · Proceedings of the 25th Symposium on Operating Systems Principles · doi:10.1145/2815400.2815425 · Cited by 287
Metadata
- Authors
- Chockler, G. V., Keidar, I., & Vitenberg, R.
- Venue
- ACM Computing Surveys
- Published
- 2001-12
- Volume
- 33
- Issue
- 4
- Pages
- 427-469
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2165900899
- Cited by
- 630
- References
- 31
- FWCI
- 69.29
- 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.