Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 278

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 access
Yu, Qian, Maddah-Ali, Mohammad Ali, Avestimehr, A. Salman·2018·IEEE Transactions on Information Theory

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.2017.2785237

Cites

47 of 47 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 47 references

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching. https://app.cochat.ai/papers/10.1109/tit.2017.2785237
The paper
Yu, Q., Maddah-Ali, M. A., & Avestimehr, A. S. (2018). The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2017.2785237

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.