The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Probabilistic reliable dissemination in large-scale systems
Abstract
The growth of the Internet raises new challenges for the design of distributed systems and applications. In the context of group communication protocols, gossip-based schemes have attracted interest as they are scalable, easy to deploy, and resilient to network and process failures. However, traditional gossip-based protocols have two major drawbacks: 1) they rely on each peer having knowledge of the global membership; and 2) being oblivious to the network topology, they can impose a high load on network links when applied to wide-area settings. In this paper, we provide a theoretical analysis of gossip-based protocols which relates their reliability to key system parameters (the system size, failure rates, and number of gossip targets). The results provide guidelines for the design of practical protocols. In particular, they show how reliability can be maintained while alleviating drawback by: 1) providing each peer with only a small subset of the total membership information and drawback; and 2) organizing members into a hierarchical structure that reflects their proximity according to some network-related metric. We validate the analytical results by simulations and verify that the hierarchical gossip protocol considerably reduces the load on the network compared to the original, non-hierarchical protocol.
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 Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
Zegura, E. W., Calvert, K. L., & Bhattacharjee, S. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1996.493353 · Cited by 1,679
Epidemic algorithms for replicated database maintenance
Demers, A., Greene, D., Hauser, C., Irish, W., & Larson, J. (1987) · Proceedings of the sixth annual ACM Symposium on Principles of distributed computing - PODC '87 · doi:10.1145/41840.41841 · Cited by 1,673
Scribe: a large-scale and decentralized application-level multicast infrastructure
Castro, M., Druschel, P., Kermarrec, A.-M., & Rowstron, A. I. T. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.803069 · Cited by 1,461
Self-citationMulticast routing in datagram internetworks and extended LANs
Deering, S. E., & Cheriton, D. R. (1990) · ACM Transactions on Computer Systems · doi:10.1145/78952.78953 · Cited by 1,173
A reliable multicast framework for light-weight sessions and application level framing
Floyd, S., Jacobson, V., Liu, C.-G., McCanne, S., & Zhang, L. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650139 · Cited by 1,168
Karp, R., Schindelhauer, C., Shenker, S., & Vocking, B. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892324 · Cited by 718
Birman, K. P., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., & Minsky, Y. (1999) · ACM Transactions on Computer Systems · doi:10.1145/312203.312207 · Cited by 654
Application-Level Multicast Using Content-Addressable Networks
Ratnasamy, S., Handley, M. J., Karp, R. M., & Shenker, S. J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45546-9_2 · Cited by 608
Exploiting virtual synchrony in distributed systems
Birman, K., & Joseph, T. (1987) · ACM SIGOPS Operating Systems Review · doi:10.1145/37499.37515 · Cited by 601
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
Peer-to-peer membership management for gossip-based protocols
Ganesh, A. J., Kermarrec, A.-M., & Massoulié, L. (2003) · IEEE Transactions on Computers · doi:10.1109/tc.2003.1176982 · Cited by 474
Self-citationExploiting 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
Directional Gossip: Gossip in a Wide Area Network
Lin, M.-J., & Marzullo, K. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48254-7_25 · Cited by 167
Cited by
Statistical physics of social dynamics
Castellano, C., Fortunato, S., & Loreto, V. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.591 · Cited by 4,119
Dynamics of rumor spreading in complex networks
Moreno, Y., Nekovee, M., & Pacheco, A. F. (2004) · Physical Review E · doi:10.1103/physreve.69.066130 · Cited by 936
Epidemic information dissemination in distributed systems
Eugster, P. T., Guerraoui, R., Kermarrec, A.-M., & Massoulie, L. (2004) · Computer · doi:10.1109/mc.2004.1297243 · Cited by 500
Self-citationJelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.-M., & van Steen, M. (2007) · ACM Transactions on Computer Systems · doi:10.1145/1275517.1275520 · Cited by 494
Self-citationThe Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations
Jelasity, M., Guerraoui, R., Kermarrec, A.-M., & van Steen, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30229-2_5 · Cited by 301
Self-citation
Metadata
- Authors
- Kermarrec, A.-M., Massoulie, L., & Ganesh, A. J.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2003-03
- Volume
- 14
- Issue
- 3
- Pages
- 248-258
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2112603289
- Cited by
- 381
- References
- 14
- FWCI
- 37.97
- 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.