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

Echo State Networks for Proactive Caching in Cloud-Based Radio Access Networks With Mobile Users

Open access
Chen, Mingzhe, Saad, Walid, Yin, Changchuan, Debbah, Merouane·2017·IEEE Transactions on Wireless Communications

Abstract

In this paper, the problem of proactive caching is studied for cloud radio access networks (CRANs). In the studied model, the baseband units (BBUs) can predict the content request distribution and mobility pattern of each user and determine which content to cache at remote radio heads and the BBUs. This problem is formulated as an optimization problem, which jointly incorporates backhaul and fronthaul loads and content caching. To solve this problem, an algorithm that combines the machine learning framework of echo state networks (ESNs) with sublinear algorithms is proposed. Using ESNs, the BBUs can predict each user's content request distribution and mobility pattern while having only limited information on the network's and user's state. In order to predict each user's periodic mobility pattern with minimal complexity, the memory capacity of the corresponding ESN is derived for a periodic input. This memory capacity is shown to capture the maximum amount of user information needed for the proposed ESN model. Then, a sublinear algorithm is proposed to determine which content to cache while using limited content request distribution samples. Simulation results using real data from Youku and the Beijing University of Posts and Telecommunications show that the proposed approach yields significant gains, in terms of sum effective capacity, that reach up to 27.8% and 30.7%, respectively, compared with two baseline algorithms: random caching with clustering and random caching without clustering.

Integrity signals

Registry

Crossref · 10.1109/twc.2017.2683482

Cites

35 of 35 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • An agent can be associated with each serving station in a cellular network to assist in learning optimal scheduling parameters to enhance network QoS.

    “An agent can be associated with each serving station in a cellular network to assist in learning the optimal scheduling parameters to enhance the network Quality-of-Service (QoS) [78].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Chen, M., Saad, W., Yin, C., & Debbah, M.
Affiliations
  • Beijing University of Posts and Telecommunications (CN)
  • Virginia Tech (US)
  • Supélec (FR)
Venue
IEEE Transactions on Wireless Communications
Published
2017-06
Volume
16
Issue
6
Pages
3520-3535
ISSN
1536-1276 (ISSN-L)
OpenAlex
W2962850461
Cited by
176
References
35
Citations by year
2026: 3 · 2025: 5 · 2024: 8 · 2023: 10 · 2022: 15 · 2021: 18 · 2020: 35 · 2019: 42 · 2018: 33 · 2017: 7
FWCI
21.32
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Wireless Communications (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • HAL (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Natural Science Foundation of China (61671086, 61629101)
  • ERC Starting through MORE (Advanced Mathematical Tools for Complex Network Engineering) (305123)
  • U.S. National Science Foundation (IIS-1633363, CNS-1460316, CNS-1513697)
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
proactive caching, cloud radio access network, echo state networks, user mobility prediction, baseband unit, memory capacity, sublinear-time algorithms, effective capacity, remote radio heads

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