Peer-to-peer systems
The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Abstract
Within a decade, P2P has proven to be a technology that enables innovative new services and is used by millions of people every day.
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
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
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
Self-citationDouceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419 · cited 2×
“This lack of strong user identities allows an attacker to populate a p2p system with nodes under his control, by creating many distinct identities (such action was termed a Sybil attack [15]).”
Background(2007) · doi:10.1145/1294261.1294281 · Cited by 3,447 · cited 2×
“For instance, Dynamo, 13 a storage substrate that Amazon uses internally for many of its services and applications, uses distributed hash tables (DHTs), which we will explain later.”
BackgroundIncentives Build Robustness in Bit-Torrent
Cohen, B. (2003) · Cited by 2,677
Freenet: A Distributed Anonymous Information Storage and Retrieval System
Clarke, I., Sandberg, O., Wiley, B., & Hong, T. W. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_4 · Cited by 2,109
BOINC: A System for Public-Resource Computing and Storage
Anderson, D. P. (2005) · Fifth IEEE/ACM International Workshop on Grid Computing · doi:10.1109/grid.2004.14 · Cited by 1,924
Measurement study of peer-to-peer file sharing systems:
Saroiu, S., Gummadi, P. K., & Gribble, S. D. (2001) · SPIE Proceedings · doi:10.1117/12.449977 · Cited by 1,905
Adar, E., & Huberman, B. A. (2000) · First Monday · doi:10.5210/fm.v5i10.792 · Cited by 1,527
Coolstreaming/DONet: a data-driven overlay network for peer-to-peer live media streaming
Zhang, X., Lin, J.-C., Li, B., Tak-Shing, & Yum, P. (2005) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2005.1498486 · Cited by 1,104
Cited by
The sharing economy: Why people participate in collaborative consumption
Hamari, J., Sjöklint, M., & Ukkonen, A. (2016) · Journal of the Association for Information Science and Technology · doi:10.1002/asi.23552 · Cited by 3,439
On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing
Foster, I., & Iamnitchi, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45172-3_11 · Cited by 504
Distributed and cloud computing: from parallel processing to the Internet of things
(2012) · Choice Reviews Online · doi:10.5860/choice.49-5712 · Cited by 314
Timing Attacks in Low-Latency Mix Systems
Levine, B. N., Reiter, M. K., Wang, C., & Wright, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27809-2_25 · Cited by 277
Developing Information Networking Further: From PSIRP to PURSUIT
Fotiou, N., Nikander, P., Trossen, D., & Polyzos, G. C. (2012) · Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-642-30376-0_1 · Cited by 262
The Sustainability of Polycentric Information Commons1
Mindel, V., Mathiassen, L., & Rai, A. (2018) · MIS Quarterly · doi:10.25300/misq/2018/14015 · Cited by 90
Want 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
“Fully decentralized distributed architectures, and most notably P2P systems, enjoyed a high level of interest about a decade ago, prompted by early pioneering systems such as Napster and Freenet [1], quickly followed by systems such as Gnutella, Pastry [2] or Chord [3].”
Background
Metadata
- Authors
- Rodrigues, R., & Druschel, P.
- Venue
- Communications of the ACM
- Published
- 2010-10
- Volume
- 53
- Issue
- 10
- Pages
- 72-82
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2163498454
- Cited by
- 562
- References
- 26
- FWCI
- 76.07
- 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.