Research Article
Caching Contents with Varying Popularity Using Restless Bandits
@INPROCEEDINGS{10.1007/978-3-031-48885-6_9, author={K. J. Pavamana and Chandramani Singh}, title={Caching Contents with Varying Popularity Using Restless Bandits}, proceedings={Performance Evaluation Methodologies and Tools. 16th EAI International Conference, VALUETOOLS 2023, Crete, Greece, September 6--7, 2023, Proceedings}, proceedings_a={VALUETOOLS}, year={2024}, month={1}, keywords={Caching Restless bandits Threshold policy Whittle index}, doi={10.1007/978-3-031-48885-6_9} }- K. J. Pavamana
Chandramani Singh
Year: 2024
Caching Contents with Varying Popularity Using Restless Bandits
VALUETOOLS
Springer
DOI: 10.1007/978-3-031-48885-6_9
Abstract
We study content caching in a wireless network in which the users are connected through a base station that is equipped with a finite capacity cache. We assume a fixed set of contents whose popularity vary with time. Users’ requests for the contents depend on their instantaneous popularity levels. Proactively caching contents at the base station incurs a cost but not having requested contents at the base station also incurs a cost. We propose to proactively cache contents at the base station so as to minimize content missing and caching costs. We formulate the problem as a discounted cost Markov decision problem that is a restless multi-armed bandit problem. We provide conditions under which the problem is indexable and also propose a novel approach to manoeuvre a few parameters to render the problem indexable. We demonstrate efficacy of the Whittle index policy via numerical evaluation.
