Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Abstract
Peer-to-peer (P2P) file sharing accounts for an astonishing volume of current Internet traffic. This paper probes deeply into modern P2P file sharing systems and the forces that drive them. By doing so, we seek to increase our understanding of P2P file sharing workloads and their implications for future multimedia workloads. Our research uses a three-tiered approach. First, we analyze a 200-day trace of over 20 terabytes of Kazaa P2P traffic collected at the University of Washington. Second, we develop a model of multimedia workloads that lets us isolate, vary, and explore the impact of key system parameters. Our model, which we parameterize with statistics from our trace, lets us confirm various hypotheses about file-sharing behavior observed in the trace. Third, we explore the potential impact of locality-awareness in Kazaa.Our results reveal dramatic differences between P2P file sharing and Web traffic. For example, we show how the immutability of Kazaa's multimedia objects leads clients to fetch objects at most once; in contrast, a World-Wide Web client may fetch a popular page (e.g., CNN or Google) thousands of times. Moreover, we demonstrate that: (1) this "fetch-at-most-once" behavior causes the Kazaa popularity distribution to deviate substantially from Zipf curves we see for the Web, and (2) this deviation has significant implications for the performance of multimedia file-sharing systems. Unlike the Web, whose workload is driven by document change, we demonstrate that clients' fetch-at-most-once behavior, the creation of new objects, and the addition of new clients to the system are the primary forces that drive multimedia workloads such as Kazaa. We also show that there is substantial untapped locality in the Kazaa workload. Finally, we quantify the potential bandwidth savings that locality-aware P2P file-sharing architectures would achieve.
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
Web caching and Zipf-like distributions: evidence and implications
Breslau, L., Cao, P., Fan, L., Phillips, G., & Shenker, S. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.749260 · Cited by 3,467
Self-similarity in World Wide Web traffic: evidence and possible causes
Crovella, M. E., & Bestavros, A. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650143 · Cited by 2,731
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
Self-citationAdar, E., & Huberman, B. A. (2000) · First Monday · doi:10.5210/fm.v5i10.792 · Cited by 1,527
Generating representative Web workloads for network and server performance evaluation
Barford, P., & Crovella, M. (1998) · Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems · doi:10.1145/277851.277897 · Cited by 1,431
Predicting Internet network distance with coordinates-based approaches
Ng, T. S. E., & Zhang, H. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019258 · Cited by 1,050
The BSD packet filter: a new architecture for user-level packet capture
McCanne, S., & Jacobson, V. L. (1993) · Cited by 885
Gummadi, K. P., Saroiu, S., & Gribble, S. D. (2002) · ACM SIGCOMM Computer Communication Review · doi:10.1145/571697.571700 · Cited by 625
Self-citationBhagwan, R., Savage, S., & Voelker, G. M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45172-3_24 · Cited by 563
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-citationOn the scale and performance of cooperative Web proxy caching
Wolman, A., Voelker, M., Sharma, N., Cardwell, N., Karlin, A., & Levy, H. M. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319153 · Cited by 496
Self-citationGummadi, K. P., Saroiu, S., & Gribble, S. D. (2002) · doi:10.1145/637201.637203 · Cited by 372
Self-citationRate of change and other metrics: a live study of the world wide web
Douglis, F., Feldmann, A., Krishnamurthy, B., & Mogul, J. C. (1997) · Cited by 319
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
Analysis of educational media server workloads
Almeida, J. M., Krueger, J., Eager, D. L., & Vernon, M. K. (2001) · Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video · doi:10.1145/378344.378348 · Cited by 174
The effectiveness of request redirection on CDN robustness
Wang, L., Pai, V. S., & Peterson, L. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844160 · Cited by 156
Web caching and content distribution: a view from the interior
Gadde, S., Chase, J. S., & Rabinovich, M. (2001) · Computer Communications · doi:10.1016/s0140-3664(00)00318-2 · Cited by 100
Organization-based analysis of web-object sharing and caching
Wolman, A., Voelker, G., Sharma, N. K., Cardwell, N., Brown, M., Landray, T., Pinnel, D., Karlin, A. R., & Levy, H. M. (1999) · USENIX Symposium on Internet Technologies and Systems · Cited by 98
Self-citation
Cited by
I tube, you tube, everybody tubes: analyzing the world's largest user generated content video system
Cha, M., Kwak, H., Rodriguez, P., Ahn, Y.-Y., & Moon, S. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298309 · Cited by 1,576
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
The Effect of File Sharing on Record Sales: An Empirical Analysis
Oberholzer‐Gee, F., & Strumpf, K. (2007) · Journal of Political Economy · doi:10.1086/511995 · Cited by 864
A Measurement Study of a Large-Scale P2P IPTV System
Hei, X., Liang, C., Liang, J., Liu, Y., & Ross, K. W. (2007) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2007.907451 · Cited by 851
Accurate, scalable in-network identification of p2p traffic using application signatures
Sen, S., Spatscheck, O., & Wang, D. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988742 · Cited by 807
Metadata
- Authors
- Gummadi, K. P., Dunn, R. J., Saroiu, S., Gribble, S. D., Levy, H. M., & Zahorjan, J.
- Venue
- ACM SIGOPS Operating Systems Review
- Published
- 2003-10-19
- Volume
- 37
- Issue
- 5
- Pages
- 314-329
- ISSN
- 0163-5980 (ISSN-L)
- OpenAlex
- W2153527920
- Cited by
- 818
- References
- 18
- FWCI
- 104.75
- 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.