CoChat

Placing dynamic content in caches with small population

Open access
Leconte, Mathieu, Paschos, Georgios, Gkatzikis, Lazaros, Draief, Moez, Vassilaras, Spyridon, Chouvardas, Symeon · 2016 · IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications
Cited by 151

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Abstract

This paper addresses a fundamental limitation for the adoption of caching for wireless access networks due to small population sizes. This shortcoming is due to two main challenges: making timely estimates of varying content popularity and inferring popular content from small samples. We propose a framework which alleviates such limitations. To timely estimate varying popularity in a context of a single cache we propose an Age-Based Threshold (ABT) policy which caches all contents requested more times than a threshold N (τ), where τ is the content age. We show that ABT is asymptotically hit rate optimal in the many contents regime, which allows us to obtain the first characterization of the optimal performance of a caching system in a dynamic context. We then address small sample sizes focusing on L local caches and one global cache. On the one hand we show that the global cache learns L times faster by aggregating all requests from local caches, which improves hit rates. On the other hand, aggregation washes out local characteristics of correlated traffic which penalizes hit rate. This motivates coordination mechanisms which combine global learning of popularity scores in clusters and Least-Recently-Used (LRU) policy with prefetching.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1109/infocom.2016.7524380

Cites

4 of 4 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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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 4 references

Cited by

See all 151

Metadata

Authors
Leconte, M., Paschos, G., Gkatzikis, L., Draief, M., Vassilaras, S., & Chouvardas, S.
Venue
IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications
Publisher
IEEE
Published
2016-04
Pages
1-9
OpenAlex
W2404272329
Cited by
151
References
4
FWCI
26.93
Type
conference paper
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: Placing dynamic content in caches with small population. https://app.cochat.ai/papers/10.1109/infocom.2016.7524380
The paper
Leconte, M., Paschos, G., Gkatzikis, L., Draief, M., Vassilaras, S., & Chouvardas, S. (2016). Placing dynamic content in caches with small population. IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications. https://doi.org/10.1109/infocom.2016.7524380

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.