Learning distributed caching strategies in small cell networks
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Caching has emerged as a vital tool in modern communication systems for reducing peak data rates by allowing popular files to be pre-fetched and stored locally at end users' devices. With the shift in paradigm from homogeneous cellular networks to the heterogeneous ones, the concept of data offloading to small cell base stations (sBS) has garnered significant attention. Caching at these small cell base stations has recently been proposed, where popular files are pre-fetched and stored locally in order to avoid bottlenecks in the limited capacity backhaul connection link to the core network. In this paper, we study distributed caching strategies in such a heterogeneous small cell wireless network from a reinforcement learning perspective. Using state of the art results, it can be shown that the optimal joint cache content placement in the sBSs turns out to be a NP-hard problem even when the sBS's are aware of the popularity profile of the files that are to be cached. To address this problem, we propose a coded caching framework, where the sBSs learn the popularity profile of the files (based on their demand history) via a combinatorial multi-armed bandit framework. The sBSs then pre-fetch segments of the Fountain-encoded versions of the popular files at regular intervals to serve users' requests. We show that the proposed coded caching framework can be modeled as a linear program that takes into account the network connectivity and thereby jointly designs the caching strategies. Numerical results are presented to show the benefits of the joint coded caching technique over naive decentralized cache placement strategies.
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
Finite-time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002) · Machine Learning · doi:10.1023/a:1013689704352 · Cited by 6,033
Maddah-Ali, M. A., & Niesen, U. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2306938 · Cited by 1,726 · cited 1×
“Different aspects of caching networks have recently been studied in literature [1]–[4].”
Background
Cited by
A Survey on Mobile Edge Networks: Convergence of Computing, Caching and Communications
Wang, S., Zhang, X., Zhang, Y., Wang, L., YANG, J., & Wang, W. (2017) · IEEE Access · doi:10.1109/access.2017.2685434 · Cited by 952
Context-Aware Proactive Content Caching With Service Differentiation in Wireless Networks
Muller, S., Atan, O., van der Schaar, M., & Klein, A. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2016.2636139 · Cited by 281
Optimal 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
Learning Based Content Caching and Sharing for Wireless Networks
Song, J., Sheng, M., Quek, T. Q. S., Xu, C., & Wang, X. (2017) · IEEE Transactions on Communications · doi:10.1109/tcomm.2017.2713384 · Cited by 144
Federated Learning Based Proactive Content Caching in Edge Computing
Yu, Z., Hu, J., Min, G., Lu, H., Zhao, Z., Wang, H., & Georgalas, N. (2018) · 2018 IEEE Global Communications Conference (GLOBECOM) · doi:10.1109/glocom.2018.8647616 · Cited by 140
Metadata
- Authors
- Sengupta, A., Amuru, S., Tandon, R., Buehrer, R. M., & Clancy, T. C.
- Venue
- 2014 11th International Symposium on Wireless Communications Systems (ISWCS)
- Publisher
- IEEE
- Published
- 2014-08
- Pages
- 917-921
- OpenAlex
- W1972458861
- Cited by
- 138
- References
- 2
- FWCI
- 9.12
- Type
- conference paper
- 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: Learning distributed caching strategies in small cell networks. https://app.cochat.ai/papers/10.1109/iswcs.2014.6933484
- The paper
- Sengupta, A., Amuru, S., Tandon, R., Buehrer, R. M., & Clancy, T. C. (2014). Learning distributed caching strategies in small cell networks. 2014 11th International Symposium on Wireless Communications Systems (ISWCS). https://doi.org/10.1109/iswcs.2014.6933484
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.