The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Fundamental Limits of Cache-Aided Interference Management
Abstract
We consider a system, comprising a library of N files (e.g., movies) and a wireless network with a KTtransmitters, each equipped with a local cache of size of MTfiles and a KRreceivers, each equipped with a local cache of size of MRfiles. Each receiver will ask for one of the N files in the library, which needs to be delivered. The objective is to design the cache placement (without prior knowledge of receivers' future requests) and the communication scheme to maximize the throughput of the delivery. In this setting, we show that the sum degrees-of-freedom (sum-DoF) of {(KTMT+KRMR)/N, KR} is achievable, and this is within a factor of 2 of the optimum, under uncoded prefetching and one-shot linear delivery schemes. This result shows that (i) the one-shot sum-DoF scales linearly with the aggregate cache size in the network (i.e., the cumulative memory available at all nodes), (ii) the transmitters' caches and receivers' caches contribute equally in the one-shot sum-DoF, and (iii) caching can offer a throughput gain that scales linearly with the size of the network. To prove the result, we propose an achievable scheme that exploits the redundancy of the content at transmitter's caches to cooperatively zero-force some outgoing interference, and availability of the unintended content at the receiver's caches to cancel (subtract) some of the incoming interference. We develop a particular pattern for cache placement that maximizes the overall gains of cache-aided transmit and receive interference cancellations. For the converse, we present an integer optimization problem which minimizes the number of communication blocks needed to deliver any set of requested files to the receivers. We then provide a lower bound on the value of this optimization problem, hence leading to an upper bound on the linear one-shot sum-DoF of the network, which is within a factor of 2 of the achievable sum-DoF.
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
Maddah-Ali, M. A., & Niesen, U. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2306938 · Cited by 1,726
Self-citation
Cited by
A Survey on Low Latency Towards 5G: RAN, Core Network and Caching Solutions
Parvez, I., Rahmati, A., Guvenc, I., Sarwat, A. I., & Dai, H. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2841349 · Cited by 883
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
- Naderializadeh, N., Maddah-Ali, M. A., & Avestimehr, A. S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2017
- Pages
- 1-1
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2589022566
- Cited by
- 199
- References
- 1
- FWCI
- 23.11
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fundamental Limits of Cache-Aided Interference Management. https://app.cochat.ai/papers/10.1109/tit.2017.2669942
- The paper
- Naderializadeh, N., Maddah-Ali, M. A., & Avestimehr, A. S. (2017). Fundamental Limits of Cache-Aided Interference Management. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2017.2669942
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.