Fresh Caching of Dynamic Contents using Restless Multi-armed Bandits
We consider a dynamic content caching problem wherein the contents get updated at a central server, and local copies of a subset of contents are cached at a local cache associated with a Base station (BS). When a content request arrives, based on whether the content is in the local cache, the BS can...
Saved in:
Published in | IEEE International Conference on Mobile Ad-hoc and Sensor Systems pp. 238 - 246 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
23.09.2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!