The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations
Open accessOverview
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
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
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
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
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
Cohen, E. A., & Barabási, A.-L. (2002) · Foreign Affairs · doi:10.2307/20033300 · Cited by 1,788
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
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
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
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-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-citationLightweight 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
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-citationEpidemic-style proactive aggregation in large overlay networks
Jelasity, M., & Montresor, A. (2004) · 24th International Conference on Distributed Computing Systems, 2004. Proceedings. · doi:10.1109/icdcs.2004.1281573 · Cited by 172
Self-citation
Cited by
CYCLON: 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-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-citationDesign patterns from biology for distributed computing
Babaoglu, O., Canright, G., Deutsch, A., Caro, G. A. D., Ducatelle, F., Gambardella, L. M., Ganguly, N., Jelasity, M., Montemanni, R., Montresor, A., et al. (2006) · ACM Transactions on Autonomous and Adaptive Systems · doi:10.1145/1152934.1152937 · Cited by 302
Self-citation
Metadata
- Authors
- Jelasity, M., Guerraoui, R., Kermarrec, A.-M., & van Steen, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2004
- Pages
- 79-98
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W4244955832
- Cited by
- 301
- References
- 18
- FWCI
- 16.18
- Type
- conference paper
- 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.