The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays
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
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
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
Bollobás, B. (1985) · Cited by 6,196
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639
Looking up data in P2P systems
Balakrishnan, H., Kaashoek, M. F., Karger, D., Morris, R., & Stoica, I. (2003) · Communications of the ACM · doi:10.1145/606272.606299 · Cited by 546
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
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
The 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
Building low-diameter P2P networks
Pandurangan, G., Raghavan, P., & Upfal, E. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959925 · Cited by 191
Distributed construction of random expander networks
Law, C., & Siu, K.-Y. (2004) · doi:10.1109/infcom.2003.1209234 · Cited by 159
Epidemic-Style Management of Semantic Overlays for Content-Based Searching
Voulgaris, S., & van Steen, M. R. (2005) · Lecture notes in computer science · doi:10.1007/11549468_125 · Cited by 146
Self-citationA Robust and Scalable Peer-to-Peer Gossiping Protocol
Voulgaris, S., Jelasity, M., & van Steen, M. R. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25840-7_6 · Cited by 96
Self-citationPhenix: supporting resilient low-diameter peer-to-peer topologies
Wouhaybi, R. H., & Campbell, A. T. (2004) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2004.1354486 · Cited by 59
Cited by
Jelasity, 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-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
A Routing Table Poisoning Model for Peer-to-Peer (P2P) Botnets
Tetarave, S. K., Tripathy, S., Kalaimannan, E., John, C., & Srivastava, A. (2019) · IEEE Access · doi:10.1109/access.2019.2906875 · Cited by 7
Metadata
- Authors
- Voulgaris, S., Gavidia, D., & van Steen, M.
- Venue
- Journal of Network and Systems Management
- Published
- 2005-06
- Volume
- 13
- Issue
- 2
- Pages
- 197-217
- ISSN
- 1064-7570 (ISSN-L)
- 1573-7705
- OpenAlex
- W2151107368
- Cited by
- 510
- References
- 14
- FWCI
- 48.53
- 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.