The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
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
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
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
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
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
Understanding churn in peer-to-peer networks
Stutzbach, D., & Rejaie, R. (2006) · Proceedings of the 6th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1177080.1177105 · Cited by 751
P4p: provider portal for applications
Xie, H., Yang, Y. R., Krishnamurthy, A., Liu, Y. G., & Silberschatz, A. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402999 · Cited by 628
Information-centric networking: seeing the forest for the trees
Ghodsi, A., Shenker, S., Koponen, T., Singla, A., Raghavan, B., & Wilcox, J. (2011) · Proceedings of the 10th ACM Workshop on Hot Topics in Networks · doi:10.1145/2070562.2070563 · Cited by 321
An analysis of live streaming workloads on the internet
Sripanidkulchai, K., Maggs, B., & Zhang, H. (2004) · Proceedings of the 4th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1028788.1028795 · Cited by 317
A secure self-destructing scheme for electronic data
Wang, G., Yue, F., & Liu, Q. (2013) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2012.05.008 · Cited by 44
Metadata
- Authors
- Gummadi, K. P., Dunn, R. J., Saroiu, S., Gribble, S. D., Levy, H. M., & Zahorjan, J.
- Venue
- Proceedings of the nineteenth ACM symposium on Operating systems principles
- Publisher
- ACM
- Published
- 2003-10-19
- Pages
- 314-329
- OpenAlex
- W4237570262
- Cited by
- 232
- References
- 1
- FWCI
- 14.73
- 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.