Cited by 257Caching and Content DeliveryIoT and Edge/Fog ComputingAge of Information Optimization

Optimal and Scalable Caching for 5G Using Reinforcement Learning of Space-Time Popularities

Open access
Sadeghi, Alireza, Sheikholeslami, Fatemeh, Giannakis, Georgios B.·2018·IEEE Journal of Selected Topics in Signal Processing

Abstract

Small basestations (SBs) equipped with caching units have potential to handle the unprecedented demand growth in heterogeneous networks. Through low-rate, backhaul connections with the backbone, SBs can prefetch popular files during off-peak traffic hours, and service them to the edge at peak periods. To intelligently prefetch, each SB must learn what and when to cache, while taking into account SB memory limitations, the massive number of available contents, the unknown popularity profiles, as well as the space-time popularity dynamics of user file requests. In this paper, local and global Markov processes model user requests, and a reinforcement learning (RL) framework is put forth for finding the optimal caching policy when the transition probabilities involved are unknown. Joint consideration of global and local popularity demands along with cache-refreshing costs allow for a simple, yet practical asynchronous caching approach. The novel RL-based caching relies on a Q-learning algorithm to implement the optimal policy in an online fashion, thus, enabling the cache control unit at the SB to learn, track, and possibly adapt to the underlying dynamics. To endow the algorithm with scalability, a linear function approximation of the proposed Q-learning scheme is introduced, offering faster convergence as well as reduced complexity and memory requirements. Numerical tests corroborate the merits of the proposed approach in various realistic settings.

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.

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

Integrity signals

Registry

Crossref · 10.1109/jstsp.2017.2787979

Cites

40 of 40 references verified0 citation errors · 0 not checkable

Statistics

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.

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.

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. [26][26] C. J. Watkins and P. Dayan, 'Q-learning,' Machine learning , vol. 8, no. 3-4, pp. 279-292, 1992. -
  2. [27][27] V. S. Borkar and S. P. Meyn, 'The ODE method for convergence of stochastic approximation and reinforcement learning,' SIAM Journal on Control and Optimization , vol. 38, no. 2, pp. 447-469, 2000. -

Cited by

Sorted by citations

Authors
Sadeghi, A., Sheikholeslami, F., & Giannakis, G. B.
Affiliations
University of Minnesota (US)
Venue
IEEE Journal of Selected Topics in Signal Processing
Published
2018-02
Volume
12
Issue
1
Pages
180-190
ISSN
  • 1932-4553 (ISSN-L)
  • 1941-0484
OpenAlex
W2746390786
Cited by
257
References
39
Citations by year
2026: 5 · 2025: 5 · 2024: 23 · 2023: 21 · 2022: 32 · 2021: 41 · 2020: 57 · 2019: 58 · 2018: 15
FWCI
23.68
Type
journal article
Language
en
Open access
Locations
  • IEEE Journal of Selected Topics in Signal Processing (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
National Science Foundation (1423316, 1508993, 1514056, 1711471)
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, small cells, 5G, reinforcement learning, Q-learning, prefetching, edge caching, Markov processes, linear function approximation, scalability, heterogeneous 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