The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Learning-based optimization of cache content in a small cell base station
Open accessAbstract
Optimal cache content placement in a wireless small cell base station (sBS) with limited backhaul capacity is studied. The sBS has a large cache memory and provides content-level selective offloading by delivering high data rate contents to users in its coverage area. The goal of the sBS content controller (CC) is to store the most popular contents in the sBS cache memory such that the maximum amount of data can be fetched directly form the sBS, not relying on the limited backhaul resources during peak traffic periods. If the popularity profile is known in advance, the problem reduces to a knapsack problem. However, it is assumed in this work that, the popularity profile of the files is not known by the CC, and it can only observe the instantaneous demand for the cached content. Hence, the cache content placement is optimised based on the demand history. By refreshing the cache content at regular time intervals, the CC tries to learn the popularity profile, while exploiting the limited cache capacity in the best way possible. Three algorithms are studied for this cache content placement problem, leading to different exploitation-exploration trade-offs. We provide extensive numerical simulations in order to study the time-evolution of these algorithms, and the impact of the system parameters, such as the number of files, the number of users, the cache size, and the skewness of the popularity profile, on the performance. It is shown that the proposed algorithms quickly learn the popularity profile for a wide range of system parameters.
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
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
Web caching and Zipf-like distributions: evidence and implications
Breslau, L., Cao, P., Fan, L., Phillips, G., & Shenker, S. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.749260 · Cited by 3,467
Asymptotically efficient adaptive allocation rules
Lai, T. L., & Robbins, H. (1985) · Advances in Applied Mathematics · doi:10.1016/0196-8858(85)90002-8 · Cited by 2,406
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
Bubeck, S., & Cesa-Bianchi, N. (2012) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000024 · Cited by 1,295
Improved Algorithms for Linear Stochastic Bandits
Abbasi-Yadkori, Y., Pál, D., & Szepesvári, C. (2011) · Cited by 919
Discrete-Variable Extremum Problems
Dantzig, G. B. (1957) · Operations Research · doi:10.1287/opre.5.2.266 · Cited by 910
FemtoCaching: Wireless video content delivery through distributed caching helpers
Golrezaei, N., Shanmugam, K., Dimakis, A. G., Molisch, A. F., & Caire, G. (2012) · 2012 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2012.6195469 · Cited by 711
Distributed Caching Algorithms for Content Distribution Networks
Borst, S., Gupta, V., & Walid, A. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5461964 · Cited by 681
Combinatorial multi-armed bandit: general framework, results and applications
Chen, W., Wang, Y., & Yang, Y. (2013) · Cited by 104
Exploiting user mobility for wireless content delivery
Poularakis, K., & Tassiulas, L. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620380 · Cited by 103
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
A Survey of Machine Learning Techniques Applied to Self-Organizing Cellular Networks
Klaine, P. V., Imran, M. A., Onireti, O., & Souza, R. D. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2727878 · Cited by 472
Wang, X., Wang, C., Li, X., Leung, V. C. M., & Taleb, T. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2986803 · Cited by 402
Cache-enabled small cell networks: modeling and tradeoffs
Baştuǧ, E., Bennis, M., Kountouris, M., & Debbah, M. (2015) · EURASIP Journal on Wireless Communications and Networking · doi:10.1186/s13638-015-0250-4 · Cited by 292
Li, L., Zhao, G., & Blum, R. S. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2820021 · Cited by 282
Metadata
- Authors
- Blasco, P., & Gunduz, D.
- Venue
- 2014 IEEE International Conference on Communications (ICC)
- Publisher
- IEEE
- Published
- 2014-06
- Pages
- 1897-1903
- ISSN
- 1550-3607 (ISSN-L)
- OpenAlex
- W2037169571
- Cited by
- 298
- References
- 11
- FWCI
- 21.11
- 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: Learning-based optimization of cache content in a small cell base station. https://app.cochat.ai/papers/10.1109/icc.2014.6883600
- The paper
- Blasco, P., & Gunduz, D. (2014). Learning-based optimization of cache content in a small cell base station. 2014 IEEE International Conference on Communications (ICC). https://doi.org/10.1109/icc.2014.6883600
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.