Water-Filling-Based Scheduling for Weighted Binary Freshness in Cache Update Systems
- 9 October 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (5) , 8961-8972
Abstract
We consider a cache update system with a remote server delivering time-varying contents of multiple Internet of Things (IoT) items with heterogeneous popularities and service times to a local cache so as to keep the items as fresh as possible at the cache. New content for an item arrives at the server according to a Poisson process and the server is equipped with multiple queues each of which holds the most up-to-date content for the corresponding item. In this setting, we study several scheduling policies employed at the server so as to maximize the popularity-weighted binary freshness across the items. The scheduling problem is first formulated as an infinite-horizon average-reward Markov Decision Process (MDP) which suffers from the curse of dimensionality when the number of items is large. We then propose a Water-Filling based Scheduling (WFS) policy and its extension, namely Extended WFS (E-WFS) policy, with worst-case complexities being quadratic and cubic in the number of items, respectively, based on convex optimization applied to a relaxation of the original system. Simulation results are provided to validate the effectiveness of the proposed policies.Keywords
This publication has 38 references indexed in Scilit:
- Gossiping with Binary Freshness Metric2021
- Timely Tracking of Infection Status of Individuals in a Population2021
- Fresh Caching for Dynamic Content2021
- Cached Files Updating Revisited: The Distribution of Popularity-Weighted Average File AgeIEEE Access, 2020
- Maximizing Information Freshness in Caching Systems with Limited Cache Storage Capacity2020
- Accounting for Information Freshness in Scheduling of Content Caching2020
- Optimizing age-of-information in a multi-class queueing system2015
- Real-time status: How often should one update?2012
- Convex Optimization2004
- Markov Decision Processes1994