The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities
Open accessAbstract
We introduce PlanetP, content addressable publish/subscribe service for unstructured peer-to-peer (P2P) communities. PlanetP supports content addressing by providing: (1) a gossiping layer used to globally replicate a membership directory and an extremely compact content index; and (2) a completely distributed content search and ranking algorithm that help users find the most relevant information. PlanetP is a simple, yet powerful system for sharing information. PlanetP is simple because each peer must only perform a periodic, randomized, point-to-point message exchange with other peers. PlanetP is powerful because it maintains a globally content-ranked view of the shared data. Using simulation and a prototype implementation, we show that PlanetP achieves ranking accuracy that is comparable to a centralized solution and scales easily to several thousand peers while remaining resilient to rapid membership changes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
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
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
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
The many faces of publish/subscribe
Eugster, P. T., Felber, P. A., Guerraoui, R., & Kermarrec, A.-M. (2003) · ACM Computing Surveys · doi:10.1145/857076.857078 · Cited by 3,145
Generative communication in Linda
Gelernter, D. (1985) · ACM Transactions on Programming Languages and Systems · doi:10.1145/2363.2433 · Cited by 2,266
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing
Zhao, B. Y., Kubiatowicz, J. D., & Joseph, A. D. (2001) · Cited by 2,146
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357007 · Cited by 2,002
Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., & Lewin, D. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258660 · Cited by 1,981
Cited by
Survey of research towards robust peer-to-peer networks: Search methods
Risson, J., & Moors, T. (2006) · Computer Networks · doi:10.1016/j.comnet.2006.02.001 · Cited by 386
Metadata
- Authors
- Cuenca-Acuna, F. M., Peery, C., Martin, R. P., & Nguyen, T. D.
- Venue
- High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on
- Publisher
- IEEE Comput. Soc
- Published
- 2004-01-24
- Pages
- 236-246
- OpenAlex
- W2102672769
- Cited by
- 300
- References
- 25
- FWCI
- 20.94
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities. https://app.cochat.ai/papers/10.1109/hpdc.2003.1210033
- The paper
- Cuenca-Acuna, F. M., Peery, C., Martin, R. P., & Nguyen, T. D. (2004). PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities. High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on. https://doi.org/10.1109/hpdc.2003.1210033
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.
