The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
A deep reinforcement learning-based framework for content caching
Open accessAbstract
Content caching at the edge nodes is a promising technique to reduce the data traffic in next-generation wireless networks. Inspired by the success of Deep Reinforcement Learning (DRL) in solving complicated control problems, this work presents a DRL-based framework with Wolpertinger architecture for content caching at the base station. The proposed framework is aimed at maximizing the long-term cache hit rate, and it requires no knowledge of the content popularity distribution. To evaluate the proposed framework, we compare the performance with other caching algorithms, including Least Recently Used (LRU), Least Frequently Used (LFU), and First-In First-Out (FIFO) caching strategies. Meanwhile, since the Wolpertinger architecture can effectively limit the action space size, we also compare the performance with Deep Q-Network to identify the impact of dropping a portion of the actions. Our results show that the proposed framework can achieve improved short-term cache hit rate and improved and stable long-term cache hit rate in comparison with LRU, LFU, and FIFO schemes. Additionally, the performance is shown to be competitive in comparison to Deep Q-learning, while the proposed framework can provide significant savings in runtime.
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.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“As illustrated in [233] [234], the complexity of optimization algorithms can be transferred to the training of DNNs, and thus breaking the practical limitation of employing them.”
From Convergence of Edge Computing and Deep Learning: A Comprehensive Survey (2020) · cites this paper as [234]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Compared DQL-based algorithms searching the whole action space, the trained DRL agent with DDPG and Wolpertinger architecture is able to achieve competitive cache hit rates while reducing the runtime.”
From Convergence of Edge Computing and Deep Learning: A Comprehensive Survey (2020) · cites this paper as [241]
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
Continuous control with deep reinforcement learning
Lillicrap, T. P., Hunt, J. J., Pritzel, A., Heess, N., Erez, T., Tassa, Y., Silver, D., & Wierstra, D. (2015) · arXiv · doi:10.48550/arxiv.1509.02971 · Cited by 10,782
High performance cache replacement using re-reference interval prediction (RRIP)
Jaleel, A., Theobald, K. B., Steely, S. C., & Emer, J. (2010) · Proceedings of the 37th annual international symposium on Computer architecture · doi:10.1145/1815961.1815971 · Cited by 641
Learning-based optimization of cache content in a small cell base station
Blasco, P., & Gunduz, D. (2014) · 2014 IEEE International Conference on Communications (ICC) · doi:10.1109/icc.2014.6883600 · Cited by 298
Reinforcement Learning in Large Discrete Action Spaces.Preprint
Dulac-Arnold, G., Evans, R., Sunehag, P., & Coppin, B. (2015) · arXiv (Cornell University) · Cited by 292
Caching performance of content centric networks under multi-path routing (and more)
Rossi, D., & Rossini, G. (2011) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 291
Deep Reinforcement Learning in Large Discrete Action Spaces
Dulac-Arnold, G., Evans, R., van Hasselt, H., Sunehag, P., Lillicrap, T., Hunt, J., Mann, T., Weber, T., Degris, T., & Coppin, B. (2015) · arXiv · doi:10.48550/arxiv.1512.07679 · Cited by 290
High performance cache replacement using re-reference interval prediction (RRIP)
Jaleel, A., Theobald, K. B., Steely, S. C., & Emer, J. (2010) · ACM SIGARCH Computer Architecture News · doi:10.1145/1816038.1815971 · Cited by 264
Popularity-driven content caching
Li, S., Xu, J., van der Schaar, M., & Li, W. (2016) · IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications · doi:10.1109/infocom.2016.7524381 · Cited by 158
Placing dynamic content in caches with small population
Leconte, M., Paschos, G. S., Gkatzikis, L., Draief, M., Vassilaras, S., & Chouvardas, S. (2016) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2016.7524380 · Cited by 153
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
Cited by
Applications of Deep Reinforcement Learning in Communications and Networking: A Survey
Luong, N. C., Hoang, D. T., Gong, S., Niyato, D., Wang, P., Liang, Y.-C., & Kim, D. I. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2916583 · Cited by 2,060
Deep Learning With Edge Computing: A Review
Chen, J., & Ran, X. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2921977 · Cited by 1,540
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
“[192] DRL DDPG Maximize the long-term cache hit rate”
BackgroundMethodApplication of Machine Learning in Wireless Networks: Key Techniques and Open Issues
Sun, Y., Peng, M., Zhou, Y., Huang, Y., & Mao, S. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2924243 · Cited by 678
Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future
Nawaz, S. J., Sharma, S. K., Wyne, S., Patwary, M. N., & Asaduzzaman, M. (2019) · IEEE Access · doi:10.1109/access.2019.2909490 · Cited by 658
Metadata
- Authors
- Zhong, C., Gursoy, M. C., & Velipasalar, S.
- Affiliations
- Syracuse University (US)
- Venue
- 2018 52nd Annual Conference on Information Sciences and Systems (CISS)
- Publisher
- IEEE
- Published
- 2018-03
- Pages
- 1-6
- OpenAlex
- W2963805280
- Semantic Scholar
- 62e318b1ca1dc63924a70e5372bf39d39ad78727
- Cited by
- 231
- References
- 15
- Citations by year
- 2026: 6 · 2025: 11 · 2024: 27 · 2023: 29 · 2022: 37 · 2021: 44 · 2020: 39 · 2019: 29 · 2018: 9
- FWCI
- 25.00
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Conference on Information Sciences and Systems (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Caching and Content Delivery
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Physical Sciences › Computer Science › Computer Networks and Communications › Age of Information Optimization
- Keywords
- content caching, edge computing, deep reinforcement learning, cache hit rate, base station caching, action space reduction, deep Q-network, LRU, LFU, FIFO, wireless networks, data traffic reduction
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: A deep reinforcement learning-based framework for content caching. https://app.cochat.ai/papers/10.1109/ciss.2018.8362276
- The paper
- Zhong, C., Gursoy, M. C., & Velipasalar, S. (2018). A deep reinforcement learning-based framework for content caching. 2018 52nd Annual Conference on Information Sciences and Systems (CISS). https://doi.org/10.1109/ciss.2018.8362276
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.