arrow
返回

Whittle Index-Based Q-Learning for Wireless Edge Caching With Linear Function Approximation

delete2024-10-01
delete0
delete
OA
AI
G
Guojun Xiong
W
Wang, Shufan
J
Jian Li *
R
Rahul Singh
DOI:10.1109/TNET.2024.3417351delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
We consider the problem of content caching at the wireless edge to serve a set of end users via unreliable wireless channels so as to minimize the average latency experienced by end users due to the constrained wireless edge cache capacity. We formulate this problem as a Markov decision process, or more specifically a restless multi-armed bandit problem, which is provably hard to solve. We begin by investigating a discounted counterpart, and prove that it admits an optimal policy of the threshold-type. We then show that this result also holds for average latency problem. Using this structural result, we establish the indexability of our problem, and employ the Whittle index policy to minimize average latency. Since system parameters such as content request rates and wireless channel conditions are often unknown and time-varying, we further develop a model-free reinforcement learning algorithm dubbed as Q(+)-Whittle-LFA that relies on Whittle index policy. However, Q(+)-Whittle-LFA requires to store the Q(+)-function values for all state-action pairs, the number of which can be extremely large for wireless edge caching. To this end, we approximate the Q-function by a parameterized function class with a much smaller dimension, and further design a Q(+)-Whittle-LFA algorithm with linear function approximation, which is called Q(+)-Whittle-LFA. We provide a finite-time bound on the mean-square error of Q(+)-Whittle-LFA. Simulation results using real traces demonstrate that Q(+)-Whittle-LFA yields excellent empirical performance.
Keyword:
Wireless communication
Indexes
Wireless sensor networks
Servers
Q-learning
Quality of experience
Costs
Wireless edge caching
restless bandits
whittle index policy
reinforcement learning
finite-time analysis

期刊

I
IEEE-ACM Transactions on Networking
IF:
3.6
论文数:
4.4K
被引数:
9.5K

机构

S
state university of new york (suny) system
学者数:
6.5W
论文数: 5.8W
被引数: 65
引用论文

引用论文

A First Course in Optimization Theory
err
IF0
err2012-06-05
err0
PREAI
errRangarajan K. Sundaram
err分享
err收藏
Towards a wireless and fully-implantable ECoG system
err2013-06-01
err0
PREAI
errE. Tolstosheeva; J. Hoeffmann; J. Pistor; D. Rotermund; T. Schellenberg; D. Boll; T. Hertzberg; V. Gordillo-Gonzalez; S. Mandon; D. Peters-Drolshagen; M. Schneider; K. Pawelzik; A. Kreiter; S. Paul; W. Lang
err分享
err收藏
Online Content Popularity Prediction and Learning in Wireless Edge Caching
err2020-02-01
err58
errOAAI
errGarg, Navneet; Sellathurai, Mathini; Bhatia, Vimal; Bharath, B. N.; Ratnarajah, Tharmalingam
err分享
err收藏
err分享
err收藏
学者 查看更多内容