Placing dynamic content in caches with small population
Open accessThe 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.
Integrity signals
Registry
Cites
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.
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
Andrews, J. G., Buzzi, S., Choi, W., Hanly, S. V., Lozano, A., Soong, A. C. K., & Zhang, J. C. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.2328098 · Cited by 8,106
Newman (2005) · doi:10.1080/00107510500052444 · Cited by 5,749
Maddah-Ali, M. A., & Niesen, U. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2306938 · Cited by 1,726 · cited 1×
“There has recently been a large body of work on cache optimization for wireless systems, cf. [4]–[7].”
BackgroundCache in the air: exploiting content caching and delivery techniques for 5G systems
Wang, X., Chen, M., Taleb, T., Ksentini, A., & Leung, V. (2014) · IEEE Communications Magazine · doi:10.1109/mcom.2014.6736753 · Cited by 1,063 · cited 3×
“This in turn makes popularity estimation very challenging [2].”
Background
Cited by
Toward Interconnected Virtual Reality: Opportunities, Challenges, and Enablers
Bastug, E., Bennis, M., Medard, M., & Debbah, M. (2017) · IEEE Communications Magazine · doi:10.1109/mcom.2017.1601089 · Cited by 550
Wireless 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-citationOptimal and Scalable Caching for 5G Using Reinforcement Learning of Space-Time Popularities
Sadeghi, A., Sheikholeslami, F., & Giannakis, G. B. (2018) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2017.2787979 · Cited by 257
“To address this issue, a transfer-learning approach is advocated in [13], [16], and [17], to improve the”
MethodThe Role of Caching in Future Communication Systems and Networks
Paschos, G. S., Iosifidis, G., Tao, M., Towsley, D., & Caire, G. (2018) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2018.2844939 · Cited by 259
Self-citationA deep reinforcement learning-based framework for content caching
Zhong, C., Gursoy, M. C., & Velipasalar, S. (2018) · 2018 52nd Annual Conference on Information Sciences and Systems (CISS) · doi:10.1109/ciss.2018.8362276 · Cited by 231
Understanding Performance of Edge Content Caching for Mobile Video Streaming
Ma, G., Wang, Z., Zhang, M., Ye, J., Chen, M., & Zhu, W. (2017) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2017.2680958 · Cited by 172
“Based on this assumption, a threshold-based caching scheme is proposed for wireless access networks, which replicates content that is requested more times than the given threshold [31].”
BackgroundDeep Reinforcement Learning for Mobile Edge Caching: Review, New Features, and Open Issues
Zhu, H., Cao, Y., Wang, W., Jiang, T., & Jin, S. (2018) · IEEE Network · doi:10.1109/mnet.2018.1800109 · Cited by 153
Deep learning-based edge caching for multi-cluster heterogeneous networks
Yang, J., Zhang, J., Ma, C., Wang, H., Zhang, J., & Zheng, G. (2020) · Neural Computing and Applications · doi:10.1007/s00521-019-04040-z · Cited by 16
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
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.