ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Caching Contents with Varying Popularity Using Restless Bandits

Pavamana, KJ and Singh, C (2024) Caching Contents with Varying Popularity Using Restless Bandits. In: Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST, 539 . pp. 133-150.

[img] PDF
Com_sci_4_2023.pdf - Published Version
Restricted to Registered users only

Download (899kB) | Request a copy
Official URL: https://doi.org/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. © 2024, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

Item Type: Journal Article
Publication: Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
Publisher: Springer Science and Business Media Deutschland GmbH
Additional Information: The copyright for this article belongs to.
Keywords: Wireless networks, Caching; Content caching; Discounted costs; Finite capacity; Fixed sets; Markov decision problem; Restless bandit; Restless multi-armed bandit; Threshold policies; Whittle index, Base stations
Department/Centre: Division of Electrical Sciences > Electrical Engineering
Date Deposited: 01 Mar 2024 09:08
Last Modified: 01 Mar 2024 09:08
URI: https://eprints.iisc.ac.in/id/eprint/83984

Actions (login required)

View Item View Item