The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Order-Optimal Rate of Caching and Coded Multicasting With Random Demands
Open accessAbstract
We consider the canonical shared link caching network formed by a source node, hosting a library of m information messages (files), connected via a noiseless multicast link to n user nodes, each equipped with a cache of size M files. Users request files independently at random according to an a-priori known demand distribution q. A coding scheme for this network consists of two phases: cache placement and delivery. The cache placement is a mapping of the library files onto the user caches that can be optimized as a function of the demand statistics, but is agnostic of the actual demand realization. After the user demands are revealed, during the delivery phase the source sends a codeword (function of the library files, cache placement, and demands) to the users, such that each user retrieves its requested file with arbitrarily high probability. The goal is to minimize the average transmission length of the delivery phase, referred to as rate (expressed in channel symbols per file). In the case of deterministic demands, the optimal min-max rate has been characterized within a constant multiplicative factor, independent of the network parameters. The case of random demands was previously addressed by applying the order-optimal min-max scheme separately within groups of files requested with similar probability. However, no complete characterization of order-optimality was previously provided for random demands under the average rate performance criterion. In this paper, we consider the random demand setting and, for the special yet relevant case of a Zipf demand distribution, we provide a comprehensive characterization of the order-optimal rate for all regimes of the system parameters, as well as an explicit placement and delivery scheme achieving order-optimal rates. We present also numerical results that confirm the superiority of our scheme with respect to previously proposed schemes for the same setting.
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
Probability and Random Processes.
Grimmett, G. R., & Stirzaker, D. R. (2001) · doi:10.1093/oso/9780198572237.001.0001 · Cited by 1,850
Maddah-Ali, M. A., & Niesen, U. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2306938 · Cited by 1,726
Cited by
Fundamental 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
Self-citationWireless caching: technical misconceptions and business barriers
Paschos, G., Bastug, E., Land, I., Caire, G., & Debbah, M. (2016) · IEEE Communications Magazine · doi:10.1109/mcom.2016.7537172 · Cited by 321
Self-citationThe 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
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
Metadata
- Authors
- Ji, M., Tulino, A. M., Llorca, J., & Caire, G.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2017-06
- Volume
- 63
- Issue
- 6
- Pages
- 3923-3949
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2963602389
- Cited by
- 233
- References
- 2
- FWCI
- 21.28
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Order-Optimal Rate of Caching and Coded Multicasting With Random Demands. https://app.cochat.ai/papers/10.1109/tit.2017.2695611
- The paper
- Ji, M., Tulino, A. M., Llorca, J., & Caire, G. (2017). Order-Optimal Rate of Caching and Coded Multicasting With Random Demands. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2017.2695611
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.