Age-optimal constrained cache updating
Authors:
- 1 June 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 141-145
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.Keywords
This publication has 8 references indexed in Scilit:
- Update or wait: How to keep your data fresh2016
- On the Age of Information in Status Update Systems With Packet ManagementIEEE Transactions on Information Theory, 2016
- Effect of Message Transmission Path Diversity on Status AgeIEEE Transactions on Information Theory, 2015
- Lazy is timely: Status updates by an energy harvesting source2015
- Stochastic Processes2013
- Real-time status updating: Multiple sources2012
- Real-time status: How often should one update?2012
- Replication strategies in unstructured peer-to-peer networks2002