Caching Dynamic Contents via Mortal Restless Bandits

Krishna, A and Singh, C (2023) Caching Dynamic Contents via Mortal Restless Bandits. In: UNSPECIFIED, pp. 342-349.

PDF pro_int_sym_mod_opt_mob_adh_wir_net_wio_2023 - Published Version Download (485kB)

Abstract

We study content caching in a network consisting of a server and a base station with a finite-capacity cache. Contents are dynamic. They stochastically arrive in the system, stay for random times, and their popularities also randomly vary while they are alive. Fetching contents from the server and storing in the base station cache incurs a cost. But not having the requested contents at the base station also incurs a cost that reflects QoS deficiency. We study optimal proactive caching to minimise the time-average content miss and caching costs. We formulate this problem as an average cost Markov decision problem that is a restless multi-armed bandit problem. We argue that the problem is indexable and explicitly derives the Whittle indices. Finally, we demonstrate the efficacy of the Whittle index policy via numerical evaluation. © 2023 IFIP.

Item Type:	Conference Paper
Publication:	Proceedings of the International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt
Publisher:	Institute of Electrical and Electronics Engineers Inc.
Additional Information:	The copyright for this article belongs to Institute of Electrical and Electronics Engineers Inc.
Keywords:	Mobile ad hoc networks, Caching; Content caching; Dynamic content; Dynamic popularity; Finite capacity; Proactive caching; Restless bandit; Threshold policies; Time averages; Whittle index, Base stations
Department/Centre:	Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology)
Date Deposited:	16 May 2024 11:00
Last Modified:	16 May 2024 11:00
URI:	https://eprints.iisc.ac.in/id/eprint/84554

Actions (login required)

View Item