The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Hierarchical Coded Caching
Abstract
Caching of popular content during off-peak hours is a strategy to reduce network loads during peak hours. Recent work has shown significant benefits of designing such caching strategies not only to locally deliver the part of the content, but also to provide coded multicasting opportunities even among users with different demands. Exploiting both of these gains was shown to be approximately optimal for caching systems with a single layer of caches. Motivated by practical scenarios, we consider, in this paper, a hierarchical content delivery network with two layers of caches. We propose a new caching scheme that combines two basic approaches. The first approach provides coded multicasting opportunities within each layer; the second approach provides coded multicasting opportunities across multiple layers. By striking the right balance between these two approaches, we show that the proposed scheme achieves the optimal communication rates to within a constant multiplicative and additive gap. We further show that there is no tension between the rates in each of the two layers up to the aforementioned gap. Thus, both the layers can simultaneously operate at approximately the minimum rate.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
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
Maddah-Ali, M. A., & Niesen, U. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2306938 · Cited by 1,726
Self-citationFemtoCaching: Wireless video content delivery through distributed caching helpers
Golrezaei, N., Shanmugam, K., Dimakis, A. G., Molisch, A. F., & Caire, G. (2012) · 2012 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2012.6195469 · Cited by 711
A Hierarchical Internet Object Cache
Chankhunthod, A., Danzig, P. B., Neerdaels, C., Schwartz, M. F., & Worrell, K. J. (1995) · doi:10.21236/ada446612 · Cited by 689
Distributed Caching Algorithms for Content Distribution Networks
Borst, S., Gupta, V., & Walid, A. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5461964 · Cited by 681
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
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
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
Self-citationOptimal content placement for a large-scale VoD system
Applegate, D., Archer, A., Gopalakrishnan, V., Lee, S., & Ramakrishnan, K. K. (2010) · Proceedings of the 6th International COnference · doi:10.1145/1921168.1921174 · Cited by 240
Shariatpanahi, S. P., Motahari, S. A., & Khalaj, B. H. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2614722 · Cited by 239
Order-Optimal Rate of Caching and Coded Multicasting With Random Demands
Ji, M., Tulino, A. M., Llorca, J., & Caire, G. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2695611 · Cited by 233
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
Content caching and delivery over heterogeneous wireless networks
Hachem, J., Karamchandani, N., & Diggavi, S. N. (2015) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2015.7218445 · Cited by 111
Self-citationOptimal Content Placement for Peer-to-Peer Video-on-Demand Systems
Tan, B., & Massoulié, L. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2012.2208199 · Cited by 102
Improved approximation of storage-rate tradeoff for caching via new outer bounds
Sengupta, A., Tandon, R., & Clancy, T. C. (2015) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282744 · Cited by 90
Coded caching under arbitrary popularity distributions
Zhang, J., Lin, X., & Wang, X. (2015) · Information Theory and Applications Workshop (ITA) · doi:10.1109/ita.2015.7308972 · Cited by 88
Hachem, J., Karamchandani, N., & Diggavi, S. N. (2014) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2014.6874794 · Cited by 81
Self-citationCoded caching for files with distinct file sizes
Zhang, J., Lin, X., Wang, C.-C., & Wang, X. (2015) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282743 · Cited by 77
Improved lower bounds for coded caching
Ghasemi, H., & Ramamoorthy, A. (2015) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282745 · Cited by 68
Pedarsani, R., Maddah-Ali, M. A., & Niesen, U. (2014) · International Conference on Communications · doi:10.1109/icc.2014.6883597 · Cited by 68
Self-citationEffect of number of users in multi-level coded caching
Hachem, J., Karamchandani, N., & Diggavi, S. N. (2015) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282746 · Cited by 44
Self-citation
Cited by
Li, L., Zhao, G., & Blum, R. S. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2820021 · Cited by 282
The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching
Yu, Q., Maddah-Ali, M. A., & Avestimehr, A. S. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2785237 · Cited by 278
Self-citation
Metadata
- Authors
- Karamchandani, N., Niesen, U., Maddah-Ali, M. A., & Diggavi, S. N.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2016-06
- Volume
- 62
- Issue
- 6
- Pages
- 3212-3229
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W1966660858
- Cited by
- 265
- References
- 22
- FWCI
- 37.58
- 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.