@inproceedings{61b0becde8a04c25a6186af9bb0f4093,
title = "Age-optimal constrained cache updating",
abstract = "We consider a system where a local cache maintains a collection of N dynamic content items that are randomly requested by local users. A capacity-constrained link to a remote network server limits the ability of the cache to hold the latest version of each item at all times, making it necessary to design an update policy. Using an age of information metric, we show under a relaxed problem formulation that an asymptotically optimal policy updates a cached item in proportion to the square root of the item's popularity. We then show experimentally that a physically realizable policy closely approximates the asymptotic optimal policy.",
author = "Yates, \{Roy D.\} and Philippe Ciblat and Aylin Yener and Michele Wigger",
note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE International Symposium on Information Theory, ISIT 2017 ; Conference date: 25-06-2017 Through 30-06-2017",
year = "2017",
month = aug,
day = "9",
doi = "10.1109/ISIT.2017.8006506",
language = "English",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "141--145",
booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",
}