Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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 access
Zhong, Chen, Gursoy, M. Cenk, Velipasalar, Senem · 2018 · 2018 52nd Annual Conference on Information Sciences and Systems (CISS)

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/ciss.2018.8362276

Cites

15 of 15 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 15 references

Cited by

See all 231

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
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
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.