The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Measurement study of peer-to-peer file sharing systems:
Abstract
The popularity of peer-to-peer multimedia file sharing applications such as Gnutella and Napster has created a flurry of recent research activity into peer-to-peer architectures. We believe that the proper evaluation of a peer-to-peer system must take into account the characteristics of the peers that choose to participate. Surprisingly, however, few of the peer-to-peer architectures currently being developed are evaluated with respect to such considerations. In this paper, we remedy this situation by performing a detailed measurement study of the two popular peer-to-peer file sharing systems, namely Napster and Gnutella. In particular, our measurement study seeks to precisely characterize the population of end-user hosts that participate in these two systems. This characterization includes the bottleneck bandwidths between these hosts and the Internet at large, IP-level latencies to send packets to these hosts, how often hosts connect and disconnect from the system, how many files hosts share and download, the degree of cooperation between the hosts, and several correlations between these characteristics. Our measurements show that there is significant heterogeneity and lack of cooperation across peers participating in these systems.
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
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
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
Resilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
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
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
Adar, E., & Huberman, B. A. (2000) · First Monday · doi:10.5210/fm.v5i10.792 · Cited by 1,527
Publius: a robust, tamper-evident, censorship-resistant web publishing system
Waldman, M., Rubin, A. D., & Cranor, L. F. (2000) · Cited by 281
Sting: a TCP-based network measurement tool
Savage, S. (1999) · USENIX Symposium on Internet Technologies and Systems · Cited by 165
Cited by
The EigenTrust algorithm for reputation management in P2P networks
Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775242 · Cited by 3,362
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
Maymounkov, P., & Mazières, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_5 · Cited by 3,004
A survey on security issues in service delivery models of cloud computing
Subashini, S., & Kavitha, V. (2011) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2010.07.006 · Cited by 2,625
Network Coding for Distributed Storage Systems
Dimakis, A. G., Godfrey, P. B., Wu, Y., Wainwright, M. J., & Ramchandran, K. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054295 · Cited by 1,914
A survey and comparison of peer-to-peer overlay network schemes
Lua, E. K., Crowcroft, J., Pias, M., Sharma, R., & Lim, S. (2005) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2005.1610546 · Cited by 1,496
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
Rowstron, A., & Druschel, P. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502053 · Cited by 1,218
Making gnutella-like P2P systems scalable
Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., & Shenker, S. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.864000 · Cited by 1,082
Restful web services vs. "big"' web services: making the right architectural decision
Pautasso, C., Zimmermann, O., & Leymann, F. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367606 · Cited by 879
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
Gummadi, K. P., Dunn, R. J., Saroiu, S., Gribble, S. D., Levy, H. M., & Zahorjan, J. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945475 · Cited by 818
Self-citationDistributing streaming media content using cooperative networking
Padmanabhan, V. N., Wang, H. J., Chou, P. A., & Sripanidkulchai, K. (2002) · Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video · doi:10.1145/507670.507695 · Cited by 809
Matei, R., Iamnitchi, A., & Foster, P. (2002) · IEEE Internet Computing · doi:10.1109/4236.978369 · Cited by 766
The Bittorrent P2P File-Sharing System: Measurements and Analysis
Pouwelse, J., Garbacki, P., Epema, D., & Sips, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11558989_19 · Cited by 760
PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing
Zhou, R., & Hwang, K. (2007) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2007.1021 · Cited by 728
Transport layer identification of P2P traffic
Karagiannis, T., Broido, A., Faloutsos, M., & claffy, K. (2004) · Proceedings of the 4th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1028788.1028804 · Cited by 708
Reclaiming space from duplicate files in a serverless distributed file system
Douceur, J. R., Adya, A., Bolosky, W. J., Simon, P., & Theimer, M. (2003) · Proceedings 22nd International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2002.1022312 · Cited by 645
Toward Secure and Dependable Storage Services in Cloud Computing
Wang, C., Wang, Q., Ren, K., Cao, N., & Lou, W. (2012) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2011.24 · Cited by 643
A reputation-based approach for choosing reliable resources in peer-to-peer networks
Damiani, E., di Vimercati, D. C., Paraboschi, S., Samarati, P., & Violante, F. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586138 · Cited by 605
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
Rodrigues, R., & Druschel, P. (2010) · Communications of the ACM · doi:10.1145/1831407.1831427 · Cited by 562
Robust incentive techniques for peer-to-peer networks
Feldman, M., Lai, K., Stoica, I., & Chuang, J. (2004) · Proceedings of the 5th ACM conference on Electronic commerce · doi:10.1145/988772.988788 · Cited by 558
An analysis of Internet content delivery systems
Saroiu, S., Gummadi, K. P., Dunn, R. J., Gribble, S. D., & Levy, H. M. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844158 · Cited by 546
Self-citationKaragiannis, T., Broido, A., Brownlee, N., Claffy, K. C., & Faloutsos, M. (2005) · IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. · doi:10.1109/glocom.2004.1378239 · Cited by 504
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
Peer-to-peer support for massively multiplayer games
Knutsson, B., Lu, H., Xu, W., & Hopkins, B. (2004) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354485 · Cited by 501
Semantic Overlay Networks for P2P Systems
Crespo, A., & Garcia-Molina, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11574781_1 · Cited by 429
A reputation system for peer-to-peer networks
Gupta, M., Judge, P., & Ammar, M. (2003) · Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video · doi:10.1145/776322.776346 · Cited by 418
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
Choosing reputable servents in a P2P network
Cornelli, F., Damiani, E., di Vimercati, S. D. C., Paraboschi, S., & Samarati, P. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511496 · Cited by 349
Characterizing residential broadband networks
Dischinger, M., Haeberlen, A., Gummadi, K. P., & Saroiu, S. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298313 · Cited by 341
Self-citationRipeanu, M., Foster, I. T., & Iamnitchi, A. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0209028 · Cited by 334
Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems
Ripeanu, M., & Foster, I. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_8 · Cited by 315
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
Free-riding and whitewashing in peer-to-peer systems
Feldman, M., Papadimitriou, C., Chuang, J., & Stoica, I. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.872882 · Cited by 310
PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities
Cuenca-Acuna, F. M., Peery, C., Martin, R. P., & Nguyen, T. D. (2004) · High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on · doi:10.1109/hpdc.2003.1210033 · Cited by 300
Pollution in P2P file sharing systems
Liang, J., Kumar, R., Xi, Y., & Ross, K. W. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498344 · Cited by 300
Analyzing peer-to-peer traffic across large networks
Sen, S., & Wang, J. (2002) · Proceedings of the second ACM SIGCOMM Workshop on Internet measurment - IMW '02 · doi:10.1145/637201.637222 · Cited by 290
A game theoretic framework for incentives in P2P systems
Buragohain, C., Agrawal, D., & Suri, S. (2004) · Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003) · doi:10.1109/ptp.2003.1231503 · Cited by 285
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
Incentives for Sharing in Peer-to-Peer Networks
Golle, P., Leyton-Brown, K., Mironov, I., & Lillibridge, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45598-1_9 · Cited by 256
Overcoming free-riding behavior in peer-to-peer systems
Feldman, M., & Chuang, J. (2005) · ACM SIGecom Exchanges · doi:10.1145/1120717.1120723 · Cited by 253
Understanding Human-Machine Networks: A Cross-Disciplinary Survey
Tsvetkova, M., Yasseri, T., Meyer, E. T., Pickering, J. B., Engen, V., Walland, P., Lüders, M., Følstad, A., & Bravos, G. (2018) · ACM Computing Surveys · doi:10.1145/3039868 · Cited by 67
Metadata
- Authors
- Saroiu, S., Gummadi, P. K., & Gribble, S. D.
- Venue
- SPIE Proceedings
- Publisher
- SPIE
- Published
- 2001-12-10
- Volume
- 4673
- Pages
- 156-170
- ISSN
- 0277-786X (ISSN-L)
- OpenAlex
- W2056363353
- Cited by
- 1,905
- References
- 8
- FWCI
- 60.76
- Type
- conference paper
- 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.