The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Distributed Caching Algorithms for Content Distribution Networks
Abstract
The delivery of video content is expected to gain huge momentum, fueled by the popularity of user-generated clips, growth of VoD libraries, and wide-spread deployment of IPTV services with features such as CatchUp/PauseLive TV and NPVR capabilities. The `time-shifted' nature of these personalized applications defies the broadcast paradigm underlying conventional TV networks, and increases the overall bandwidth demands by orders of magnitude. Caching strategies provide an effective mechanism for mitigating these massive bandwidth requirements by replicating the most popular content closer to the network edge, rather than storing it in a central site. The reduction in the traffic load lessens the required transport capacity and capital expense, and alleviates performance bottlenecks. In the present paper, we develop light-weight cooperative cache management algorithms aimed at maximizing the traffic volume served from cache and minimizing the bandwidth cost. As a canonical scenario, we focus on a cluster of distributed caches, either connected directly or via a parent node, and formulate the content placement problem as a linear program in order to benchmark the globally optimal performance. Under certain symmetry assumptions, the optimal solution of the linear program is shown to have a rather simple structure. Besides interesting in its own right, the optimal structure offers valuable guidance for the design of low-complexity cache management and replacement algorithms. We establish that the performance of the proposed algorithms is guaranteed to be within a constant factor from the globally optimal performance, with far more benign worst-case ratios than in prior work, even in asymmetric scenarios. Numerical experiments for typical popularity distributions reveal that the actual performance is far better than the worst-case conditions indicate.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Summary cache: a scalable wide-area Web cache sharing protocol
Fan, L., Cao, P., Almeida, J., & Broder, A. Z. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.851975 · Cited by 1,811
Accessing nearby copies of replicated objects in a distributed environment
Plaxton, C. G., Rajaraman, R., & Richa, A. W. (1997) · Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97 · doi:10.1145/258492.258523 · Cited by 760
Comparative Models of the File Assignment Problem
Dowdy, L. W., & Foster, D. V. (1982) · ACM Computing Surveys · doi:10.1145/356876.356883 · Cited by 472
Summary cache: a scalable wide-area Web cache sharing protocol
Fan, L., Cao, P., Almeida, J., & Broder, A. Z. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285287 · Cited by 422
Approximation Algorithms for Data Placement Problems
Baev, I., Rajaraman, R., & Swamy, C. (2008) · SIAM Journal on Computing · doi:10.1137/080715421 · Cited by 215
Placement Algorithms for Hierarchical Cooperative Caching
Korupolu, M. R., Plaxton, C. G., & Rajaraman, R. (2001) · Journal of Algorithms · doi:10.1006/jagm.2000.1129 · Cited by 175
Approximation algorithms for data placement in arbitrary networks
Baev, I. D., & Rajaraman, R. (2001) · doi:10.5555/365411.365560 · Cited by 131
Online tracking of mobile users
Awerbuch, B., & Peleg, D. (1995) · Journal of the ACM · doi:10.1145/210118.210132 · Cited by 131
Silverston, T., & Fourmaux, O. (2007) · Cited by 131
Replication algorithms in a remote caching architecture
Leff, A., Wolf, J. L., & Yu, P. S. (1993) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.250099 · Cited by 123
Cited by
Maddah-Ali, M. A., & Niesen, U. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2306938 · Cited by 1,726
FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers
Shanmugam, K., Golrezaei, N., Dimakis, A. G., Molisch, A. F., & Caire, G. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2281606 · Cited by 1,246
A Survey on Mobile Edge Networks: Convergence of Computing, Caching and Communications
Wang, S., Zhang, X., Zhang, Y., Wang, L., YANG, J., & Wang, W. (2017) · IEEE Access · doi:10.1109/access.2017.2685434 · Cited by 952
Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff
Maddah-Ali, M. A., & Niesen, U. (2015) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2014.2317316 · Cited by 626
Ren, J., Zhang, D., He, S., Zhang, Y., & Li, T. (2020) · ACM Computing Surveys · doi:10.1145/3362031 · Cited by 615
Metadata
- Authors
- Borst, S., Gupta, V., & Walid, A.
- Venue
- 2010 Proceedings IEEE INFOCOM
- Publisher
- IEEE
- Published
- 2010-03
- Pages
- 1-9
- OpenAlex
- W2083766832
- Cited by
- 681
- References
- 13
- FWCI
- 32.09
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Distributed Caching Algorithms for Content Distribution Networks. https://app.cochat.ai/papers/10.1109/infcom.2010.5461964
- The paper
- Borst, S., Gupta, V., & Walid, A. (2010). Distributed Caching Algorithms for Content Distribution Networks. 2010 Proceedings IEEE INFOCOM. https://doi.org/10.1109/infcom.2010.5461964
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.