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

Caching dynamic contents with varying popularity

Krishna, A and Burra, R and Singh, C (2021) Caching dynamic contents with varying popularity. In: 19th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks, WiOpt 2021, 18-21 Oct 2021, Virtual, Philadelphia.

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

Download (906kB)
Official URL: https://doi.org/10.23919/WiOpt52861.2021.9589297


We study content caching in a cellular network consisting of a base station with a cache. New contents arrive in the network according to a Poisson process and the contents stay for exponentially distributed times. At any given time, all the contents in the network have the same popularity or request rate. Also, contents' request rates are time-varying, instantaneous request rates being a decreasing function of the number of contents in the network. Precaching contents at the base station incurs a cost. However, fetching contents from the server on being requested incurs an even higher cost. We formulate caching problem as a Markov decision process and derive the optimal caching policy. We also propose a Reinforcement Learning based algorithm that yields precaching decisions when system parameters are unknown. Numerical results show that the proposed algorithm's time averaged cost is close to the optimal average cost. © 2021 IFIP.

Item Type: Conference Paper
Publication: 2021 19th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2021
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: Markov processes; Mobile ad hoc networks; Reinforcement learning, Cellular network; Content caching; Decreasing functions; Distributed time; Dynamic content; High costs; Instantaneous requests; Markov Decision Processes; Poisson process; Time varying, Base stations
Department/Centre: Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology)
Date Deposited: 13 Dec 2021 11:30
Last Modified: 13 Dec 2021 11:30
URI: http://eprints.iisc.ac.in/id/eprint/70722

Actions (login required)

View Item View Item