The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Gossip-based peer sampling
Open accessAbstract
Gossip-based communication protocols are appealing in large-scale distributed applications such as information dissemination, aggregation, and overlay topology management. This paper factors out a fundamental mechanism at the heart of all these protocols: the peer-sampling service. In short, this service provides every node with peers to gossip with. We promote this service to the level of a first-class abstraction of a large-scale distributed system, similar to a name service being a first-class abstraction of a local-area system. We present a generic framework to implement a peer-sampling service in a decentralized manner by constructing and maintaining dynamic unstructured overlays through gossiping membership information itself. Our framework generalizes existing approaches and makes it easy to discover new ones. We use this framework to empirically explore and compare several implementations of the peer-sampling service. Through extensive simulation experiments we show that---although all protocols provide a good quality uniform random stream of peers to each node locally---traditional theoretical assumptions about the randomness of the unstructured overlays as a whole do not hold in any of the instances. We also show that different design decisions result in severe differences from the point of view of two crucial aspects: load balancing and fault tolerance. Our simulations are validated by means of a wide-area implementation.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Rowstron, A., & Druschel, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45518-3_18 · Cited by 7,276
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383072 · Cited by 6,372
An Introduction to Kolmogorov Complexity and Its Applications
Li, M., & Vitányi, P. (2019) · Texts in Computer Science · doi:10.1007/978-3-030-11298-1 · Cited by 3,681
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Linked: The New Science of Networks
Barabási, A.-L., & Aldana-Gonzalez, M. (2003) · Physics Today · doi:10.1063/1.1570778 · Cited by 2,724
An Introduction to Kolmogorov Complexity and Its Applications
Li, M., & Vitányi, P. (1997) · Springer eBooks · doi:10.1007/978-1-4757-2606-0 · Cited by 1,775
Epidemic dynamics and endemic states in complex networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review E · doi:10.1103/physreve.63.066117 · Cited by 1,682
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
Gossip-based computation of aggregate information
Kempe, D., Dobra, A., & Gehrke, J. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238221 · Cited by 1,480
Gossip-based aggregation in large dynamic networks
Jelasity, M., Montresor, A., & Babaoğlu, Ö. (2005) · ACM Transactions on Computer Systems · doi:10.1145/1082469.1082470 · Cited by 786
Self-citationKarp, 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
Van Renesse, R., Birman, K. P., & Vogels, W. (2003) · ACM Transactions on Computer Systems · doi:10.1145/762483.762485 · Cited by 645
Analyzing Peer-To-Peer Traffic Across Large Networks
Sen, S., & Wang, J. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.826277 · Cited by 586
Bhagwan, R., Savage, S., & Voelker, G. M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45172-3_24 · Cited by 563
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 524
Self-citationCYCLON: Inexpensive Membership Management for Unstructured P2P Overlays
Voulgaris, S., Gavidia, D., & van Steen, M. (2005) · Journal of Network and Systems Management · doi:10.1007/s10922-005-4441-x · Cited by 510
Self-citationEpidemic 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-citationA 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
Lightweight probabilistic broadcast
Eugster, P. T., Guerraoui, R., Handurukande, S. B., Kouznetsov, P., & Kermarrec, A.-M. (2003) · ACM Transactions on Computer Systems · doi:10.1145/945506.945507 · Cited by 394
Self-citationPittel, B. (1987) · SIAM Journal on Applied Mathematics · doi:10.1137/0147013 · Cited by 386
Measuring and analyzing the characteristics of Napster and Gnutella hosts
Saroiu, S., Gummadi, K. P., & Gribble, S. D. (2003) · Multimedia Systems · doi:10.1007/s00530-003-0088-1 · Cited by 383
Probabilistic reliable dissemination in large-scale systems
Kermarrec, A.-M., Massoulie, L., & Ganesh, A. J. (2003) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2003.1189583 · Cited by 381
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-citationRandom graphs as models of networks
Newman, M. E. J. (2002) · Handbook of Graphs and Networks · doi:10.1002/3527602755.ch2 · Cited by 196
Some Difficult-to-Pass Tests of Randomness
Marsaglia, G., & Tsang, W. W. (2002) · Journal of Statistical Software · doi:10.18637/jss.v007.i03 · Cited by 156
(2005) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2005.1498501 · Cited by 152
Cited by
PeerSim: A scalable P2P simulator
Montresor, A., & Jelasity, M. (2009) · 2009 IEEE Ninth International Conference on Peer-to-Peer Computing · doi:10.1109/p2p.2009.5284506 · Cited by 579
Self-citationA survey on content-centric technologies for the current Internet: CDN and P2P solutions
Passarella, A. (2012) · Computer Communications · doi:10.1016/j.comcom.2011.10.005 · Cited by 226
Fully Decentralized Joint Learning of Personalized Models and Collaboration Graphs
Zantedeschi, V., Bellet, A., & Tommasi, M. (2019) · arXiv · doi:10.48550/arxiv.1901.08460 · Cited by 38
“We will rely on the availability of a peer sampling service (Jelasity et al., 2007), a classic distributed systems primitive allowing an agent to communicate with a random set of other agents (peers) in the network.”
MethodWant to scale in centralized systems? Think P2P
Kermarrec, A.-M., & Taïani, F. (2015) · Journal of Internet Services and Applications · doi:10.1186/s13174-015-0029-1 · Cited by 18
“Periodically, each protocol selects the entry in its view with the oldest timestamp [45] and sends it a message containing its profile with part (or all) of its view.”
BackgroundMethodInfluentialSelf-citation
Metadata
- Authors
- Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.-M., & van Steen, M.
- Venue
- ACM Transactions on Computer Systems
- Published
- 2007-08
- Volume
- 25
- Issue
- 3
- Pages
- 8
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W2126147068
- Cited by
- 494
- References
- 32
- FWCI
- 56.47
- Type
- journal article
- Language
- en
- Open access
- green
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.