The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching
Open accessAbstract
We consider a basic cache network, in which a single server is connected to multiple users via a shared bottleneck link. The server has a database of files (content). Each user has an isolated memory that can be used to cache content in a prefetching phase. In a following delivery phase, each user requests a file from the database, and the server needs to deliver users' demands as efficiently as possible by taking into account their cache contents. We focus on an important and commonly used class of prefetching schemes, where the caches are filled with uncoded data. We provide the exact characterization of the rate-memory tradeoff for this problem, by deriving both the minimum average rate (for a uniform file popularity) and the minimum peak rate required on the bottleneck link for a given cache size available at each user. In particular, we propose a novel caching scheme, which strictly improves the state of the art by exploiting commonality among user demands. We then demonstrate the exact optimality of our proposed scheme through a matching converse, by dividing the set of all demands into types, and showing that the placement phase in the proposed caching scheme is universally optimal for all types. Using these techniques, we also fully characterize the rate-memory tradeoff for a decentralized setting, in which users fill out their cache content without any coordination.
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
Amortized efficiency of list update and paging rules
Sleator, D. D., & Tarjan, R. E. (1985) · Communications of the ACM · doi:10.1145/2786.2793 · Cited by 2,123
Maddah-Ali, M. A., & Niesen, U. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2306938 · Cited by 1,726
Self-citationDistributed 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-citationFundamental Limits of Caching in Wireless D2D Networks
Ji, M., Caire, G., & Molisch, A. F. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2504556 · Cited by 596
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
A Fundamental Tradeoff Between Computation and Communication in Distributed Computing
Li, S., Maddah-Ali, M. A., Yu, Q., & Avestimehr, A. S. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2756959 · Cited by 451
Self-citationCoded 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-citationDynamic batching policies for an on-demand video server
Dan, A., Sitaram, D., & Shahabuddin, P. (1996) · Multimedia Systems · doi:10.1007/s005300050016 · Cited by 400
The use of multicast delivery to provide a scalable and interactive video-on-demand service
Almeroth, K. C., & Ammar, M. H. (1996) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.508282 · Cited by 336
Karamchandani, N., Niesen, U., Maddah-Ali, M. A., & Diggavi, S. N. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2557804 · Cited by 265
Self-citationPedarsani, R., Maddah-Ali, M. A., & Niesen, U. (2016) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2015.2394482 · Cited by 235
Self-citationOrder-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
Approximation Algorithms for Data Placement Problems
Baev, I., Rajaraman, R., & Swamy, C. (2008) · SIAM Journal on Computing · doi:10.1137/080715421 · Cited by 215
Fundamental Limits of Cache-Aided Interference Management
Naderializadeh, N., Maddah-Ali, M. A., & Avestimehr, A. S. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2669942 · Cited by 199
Self-citationCache-aided interference channels
Maddah-Ali, M. A., & Niesen, U. (2015) · 2015 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282567 · Cited by 197
Self-citationPlacement 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
Coding for Distributed Fog Computing
Li, S., Maddah-Ali, M. A., & Avestimehr, A. S. (2017) · IEEE Communications Magazine · doi:10.1109/mcom.2017.1600894 · Cited by 138
Self-citationA Scalable Framework for Wireless Distributed Computing
Li, S., Yu, Q., Maddah-Ali, M. A., & Avestimehr, A. S. (2017) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2017.2702605 · Cited by 134
Self-citationFundamental Limits of Cache-Aided Wireless BC: Interplay of Coded-Caching and CSIT Feedback
Zhang, J., & Elia, P. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2674668 · Cited by 119
Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Tradeoff
Amiri, M. M., & Gündüz, D. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2638841 · Cited by 114
Improved Lower Bounds for Coded Caching
Ghasemi, H., & Ramamoorthy, A. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2705166 · Cited by 114
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
On caching with more users than files
Wan, K., Tuninetti, D., & Piantanida, P. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541276 · Cited by 87
Hachem, J., Karamchandani, N., & Diggavi, S. N. (2014) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2014.6874794 · Cited by 81
Coded caching for a large number of users
Amiri, M. M., Yang, Q., & Gündüz, D. (2016) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2016.7606818 · Cited by 69
A new converse bound for coded caching
Wang, C.-Y., Lim, S. H., & Gastpar, M. (2016) · Information Theory and Applications Workshop (ITA) · doi:10.1109/ita.2016.7888186 · Cited by 63
The exact rate-memory tradeoff for caching with uncoded prefetching
Yu, Q., Maddah-Ali, M. A., & Avestimehr, A. S. (2017) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006802 · Cited by 59
Self-citationJoint cache-channel coding over erasure broadcast channels
Timo, R., & Wigger, M. (2015) · International Symposium on Wireless Communication Systems · doi:10.1109/iswcs.2015.7454328 · Cited by 54
How to optimally allocate resources for coded distributed computing?
Yu, Q., Li, S., Maddah-Ali, M. A., & Avestimehr, A. S. (2017) · International Conference on Communications · doi:10.1109/icc.2017.7996730 · Cited by 54
Self-citationInformation-Theoretic Caching: Sequential Coding for Computing
Wang, C.-Y., Lim, S. H., & Gastpar, M. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2604851 · Cited by 50
Caching and delivery via interference elimination
Tian, C., & Chen, J. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541415 · Cited by 50
Effect 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
Coded caching for reducing CSIT-feedback in wireless communications
Zhang, J., Engelmann, F., & Elia, P. (2015) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2015.7447131 · Cited by 40
Critical database size for effective caching
Ajaykrishnan, N., Prem, N. S., Prabhakaran, V. M., & Vaze, R. (2015) · National Conference on Communications · doi:10.1109/ncc.2015.7084871 · Cited by 39
Characterizing the rate-memory tradeoff in cache networks within a factor of 2
Yu, Q., Maddah-Ali, M. A., & Avestimehr, A. S. (2017) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006555 · Cited by 38
Self-citationK users caching two files: An improved achievable rate
Sahraei, S., & Gastpar, M. (2016) · Conference on Information Sciences and Systems · doi:10.1109/ciss.2016.7460574 · Cited by 35
Erasure broadcast networks with receiver caching
Bidokhti, S. S., Wigger, M., & Timo, R. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541613 · Cited by 35
Symmetry, demand types and outer bounds in caching systems
Tian, C. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541414 · Cited by 32
Edge-Facilitated Wireless Distributed Computing
Li, S., Yu, Q., Maddah-Ali, M. A., & Avestimehr, A. S. (2016) · Globecom · doi:10.1109/glocom.2016.7841765 · Cited by 30
Self-citationAn Efficient Delivery Scheme for Coded Caching
Ramakrishnan, A., Westphal, C., & Markopoulou, A. P. (2015) · International Teletraffic Congress · doi:10.1109/itc.2015.13 · Cited by 27
Novel delivery schemes for decentralized coded caching in the finite file size regime
Wan, K., Tuninetti, D., & Piantanida, P. (2017) · IEEE International Conference on Communications workshops · doi:10.1109/iccw.2017.7962819 · Cited by 20
Information theoretic caching: The multi-user case
Lim, S. H., Wang, C.-Y., & Gastpar, M. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541354 · Cited by 16
A layered caching architecture for the interference channel
Hachem, J., Niesen, U., & Diggavi, S. N. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541332 · Cited by 15
An upper bound on the capacity-memory tradeoff of degraded broadcast channels
Bidokhti, S. S., Wigger, M., & Timo, R. (2016) · International Symposium on Turbo Codes and Iterative Information Processing · doi:10.1109/istc.2016.7593135 · Cited by 11
Wang, C.-Y., Lim, S. H., & Gastpar, M. (2015) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282761 · Cited by 9
Metadata
- Authors
- Yu, Q., Maddah-Ali, M. A., & Avestimehr, A. S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2018-02
- Volume
- 64
- Issue
- 2
- Pages
- 1281-1296
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2527594325
- Cited by
- 278
- References
- 47
- FWCI
- 18.16
- Type
- journal article
- Language
- en
- Open access
- green
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.