The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Traffic Modeling and Proportional Partial Caching for Peer-to-Peer Systems
Abstract
Peer-to-peer (P2P) file sharing systems generate a major portion of the Internet traffic, and this portion is expected to increase in the future. We explore the potential of deploying proxy caches in different autonomous systems (ASes) with the goal of reducing the cost incurred by Internet service providers and alleviating the load on the Internet backbone. We conduct an eight-month measurement study to analyze the P2P traffic characteristics that are relevant to caching, such as object popularity, popularity dynamics, and object size. Our study shows that the popularity of P2P objects can be modeled by a Mandelbrot-Zipf distribution, and that several workloads exist in P2P traffic. Guided by our findings, we develop a novel caching algorithm for P2P traffic that is based on object segmentation, and proportional partial admission and eviction of objects. Our trace-based simulations show that with a relatively small cache size, a byte hit rate of up to 35% can be achieved by our algorithm, which is close to the byte hit rate achieved by an off-line optimal algorithm with complete knowledge of future requests. Our results also show that our algorithm achieves a byte hit rate that is at least 40% more, and at most triple, the byte hit rate of the common Web caching algorithms. Furthermore, our algorithm is robust in face of aborted downloads, which is a common case in P2P 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
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
Cost-aware WWW proxy caching algorithms
Cao, P., & Irani, S. (1997) · Cited by 925
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
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
A survey of Web cache replacement strategies
Podlipnig, S., & Böszörmenyi, L. (2003) · ACM Computing Surveys · doi:10.1145/954339.954341 · Cited by 760
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
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
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
Karagiannis, 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
Measuring and analyzing the characteristics of Napster and Gnutella hosts
Saroiu, S., Gummadi, K. P., & Gribble, S. D. (2003) · Multimedia Systems · doi:10.1007/s00530-003-0088-1 · Cited by 383
Rabinovich, M., & Spatscheck, O. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 342
Should Internet Service Providers Fear Peer-Assisted Content Distribution?
Karagiannis, T., Rodríguez, P., & Papagiannaki, K. (2005) · Cited by 334
Should internet service providers fear peer-assisted content distribution?
Karagiannis, T., Rodriguez, P., & Papagiannaki, K. (2005) · Proceedings of the 5th ACM SIGCOMM conference on Internet measurement - IMC '05 · doi:10.1145/1330107.1330115 · Cited by 229
Popularity-aware greedy dual-size Web proxy caching algorithms
Jin, S., & Bestavros, A. (2002) · Proceedings 20th IEEE International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2000.840936 · Cited by 170
Modeling and Caching of Peer-to-Peer Traffic
Saleh, O., & Hefeeda, M. M. (2006) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2006.320218 · Cited by 123
Self-citationCharacterizing files in the modern Gnutella network: a measurement study
Zhao, S., Stutzbach, D., & Rejaie, R. (2006) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.643557 · Cited by 107
Cache replacement policies revisited: the case of P2P traffic
Wierzbicki, A., Leibowitz, N., Ripeanu, M., & Woźniak, R. (2004) · IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid) · doi:10.1109/ccgrid.2004.1336565 · Cited by 90
Citations and the Zipf-Mandelbrot's lawPreprint
Silagadze, Z. K. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.physics/9901035 · Cited by 80
Popularity-based partial caching for VOD systems using a proxy server
Park, S. H., Lim, E. J., & Chung, K.-D. (2005) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2001.925088 · Cited by 32
Network-aware partial caching for Internet streaming media
Jin, S., Azer Bestavros, C., & Iyengar, A. (2003) · Multimedia Systems · doi:10.1007/s00530-003-0109-0 · Cited by 23
Cited by
Coded caching with nonuniform demands
Niesen, U., & Maddah-Ali, M. A. (2014) · 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) · doi:10.1109/infcomw.2014.6849235 · Cited by 415
Wang, X., Wang, C., Li, X., Leung, V. C. M., & Taleb, T. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2986803 · Cited by 402
Caching in information centric networking: A survey
Zhang, G., Li, Y., & Lin, T. (2013) · Computer Networks · doi:10.1016/j.comnet.2013.07.007 · Cited by 358
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
A Survey of IoT Applications in Blockchain Systems: Architecture, Consensus, and Traffic Modeling
Lao, L., Li, Z., Hou, S., Xiao, B., Guo, S., & Yang, Y. (2021) · ACM Computing Surveys · doi:10.1145/3372136 · Cited by 304
Metadata
- Authors
- Hefeeda, M., & Saleh, O.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2008-12
- Volume
- 16
- Issue
- 6
- Pages
- 1447-1460
- ISSN
- 1063-6692 (ISSN-L)
- 1558-2566
- OpenAlex
- W2096411785
- Cited by
- 259
- References
- 20
- FWCI
- 25.24
- 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.