The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Learning Based Content Caching and Sharing for Wireless Networks
Abstract
Content caching at base stations (BSs) is a promising technique for future wireless networks by reducing network traffic and alleviating server bottleneck. However, in practice, the content popularity distribution may change with spatio-temporal variation but be unknown for BSs, which is an intractable obstacle for efficient caching strategy design. In this paper, considering unknown popularity distribution, we explore the content caching problem by jointly optimizing the content caching in cooperative BSs, content sharing among BSs, and cost of content retrieving. We tackle the problem from a multi-armed bandit learning perspective, where the learning of the popularity distribution is incorporated with the content caching and sharing process. Specifically, we first propose a centralized algorithm by employing a semidefinite relaxation approach, and we prove that this centralized algorithm learns efficient caching by deriving a sub-linear learning regret bound. To further reduce computational complexity, we propose a distributed algorithm based on alternating direction method of multipliers, where each BS only solves their own problems by exchanging local information with neighbor BSs. Extensive simulation results show the effectiveness of the proposed algorithms in terms of learning content popularity distributions of individual BSs, offloading traffic from the content server, and reducing cost of content retrieving.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Compared to traditional RL irrelevant to DL, such as Q-learning [240] and Multi-Armed Bandit (MAB) learning [230], the advantage of DRL lies in that DNNs can learn key features from the raw observation data.”
From Convergence of Edge Computing and Deep Learning: A Comprehensive Survey (2020) · cites this paper as [230]
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
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
Semidefinite Relaxation of Quadratic Optimization Problems
Luo, Z.-Q., Ma, W.-K., So, A., Ye, Y., & Zhang, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936019 · Cited by 3,715
Five disruptive technology directions for 5G
Boccardi, F., Heath, R. W., Lozano, A., Marzetta, T. L., & Popovski, P. (2014) · IEEE Communications Magazine · doi:10.1109/mcom.2014.6736746 · Cited by 3,709
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
FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers
Shanmugam, K., Golrezaei, N., Dimakis, A. G., Molisch, A. F., & Caire, G. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2281606 · Cited by 1,246
Living on the edge: The role of proactive caching in 5G wireless networks
Bastug, E., Bennis, M., & Debbah, M. (2014) · IEEE Communications Magazine · doi:10.1109/mcom.2014.6871674 · Cited by 1,146
Cache 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 1×
“With this technique, content can be cached in base stations1 (BSs) [6]–[10] rather than CDN so that the content can be directly delivered to users by BSs, which can significantly offloading the traffic flowing to the network.”
MethodSelf-citation
Research works printed but not linked: 2
- grant, 2013, CVX Matlab Software for Disciplined Convex Programming Version 2 0
- 2016, Cisco Visual Networking Index Forecast and Methodology 2015–2020
Cited by
Convergence of Edge Computing and Deep Learning: A Comprehensive Survey
Wang, X., Han, Y., Leung, V. C. M., Niyato, D., Yan, X., & Chen, X. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2970550 · Cited by 1,498
“Compared to traditional RL irrelevant to DL, such as Q-learning [240] and Multi-Armed Bandit (MAB) learning [230], the advantage of DRL lies in that DNNs can learn key features from the raw observation data.”
BackgroundSelf-citationYao, J., Han, T., & Ansari, N. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2908280 · Cited by 248
A 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
Learn to Cache: Machine Learning for Network Edge Caching in the Big Data Era
Chang, Z., Lei, L., Zhou, Z., Mao, S., & Ristaniemi, T. (2018) · IEEE Wireless Communications · doi:10.1109/mwc.2018.1700317 · Cited by 212
“The multi-armed bandit learning scheme [10] has also been applied to edge caching design by properly designing the reward of caching.”
BackgroundMethodDeep 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
“The problem of content caching and sharing among multiple cooperative SBSs was solved through the MAB approach in [10].”
Method
Metadata
- Authors
- Song, J., Sheng, M., Quek, T. Q. S., Xu, C., & Wang, X.
- Affiliations
- Xidian University (CN)
- Singapore University of Technology and Design (SG)
- Venue
- IEEE Transactions on Communications
- Published
- 2017
- Pages
- 1-1
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2624186268
- Cited by
- 144
- References
- 37
- Citations by year
- 2026: 1 · 2025: 4 · 2024: 13 · 2023: 11 · 2022: 10 · 2021: 23 · 2020: 27 · 2019: 39 · 2018: 16
- FWCI
- 14.92
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Communications (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Caching and Content Delivery
- Physical Sciences › Computer Science › Computer Networks and Communications › Age of Information Optimization
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Keywords
- content caching, content sharing, base station, multi-armed bandits, cooperative caching, semidefinite relaxation, distributed algorithms, alternating direction method of multipliers, traffic offloading, wireless networks
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 Content Caching and Sharing for Wireless Networks. https://app.cochat.ai/papers/10.1109/tcomm.2017.2713384
- The paper
- Song, J., Sheng, M., Quek, T. Q. S., Xu, C., & Wang, X. (2017). Learning Based Content Caching and Sharing for Wireless Networks. IEEE Transactions on Communications. https://doi.org/10.1109/tcomm.2017.2713384
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.