Age of Information Aware Cache Updating with File- and Age-Dependent Update Durations

We consider a system consisting of a library of time-varying files, a server that at all times observes the current version of all files, and a cache that at the beginning stores the current versions of all files but afterwards has to update %fresh versions of these files from the server. Unlike previous works, the update duration is not constant but depends on the file and its Age of Information (AoI), i.e., of the time elapsed since it was last updated. The goal of this work is to design an update policy that minimizes the average AoI of all files with respect to a given popularity distribution. Actually a relaxed problem, close to the original optimization problem, is solved and a practical update policy is derived. The update policy relies on the file popularity and on the functions that characterize the update durations of the files depending on their AoI. Numerical simulations show a significant improvement of this new update policy compared to the so-called square-root policy that is optimal under file-independent and constant update durations.

[1]  Sennur Ulukus,et al.  Age of Information for Updates with Distortion , 2019, 2019 IEEE Information Theory Workshop (ITW).

[2]  Eytan Modiano,et al.  Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks , 2018, IEEE/ACM Transactions on Networking.

[3]  Roy D. Yates,et al.  The Age of Information: Real-Time Status Updating by Multiple Sources , 2016, IEEE Transactions on Information Theory.

[4]  Emil Björnson,et al.  Robust Monotonic Optimization Framework for Multicell MISO Systems , 2011, IEEE Transactions on Signal Processing.

[5]  Eytan Modiano,et al.  Scheduling Policies for Age Minimization in Wireless Networks with Unknown Channel State , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[6]  Walid Saad,et al.  Optimal Sampling and Updating for Minimizing Age of Information in the Internet of Things , 2018, 2018 IEEE Global Communications Conference (GLOBECOM).

[7]  Erik G. Larsson,et al.  Monotonic Optimization Framework for the Two-User MISO Interference Channel , 2010, IEEE Transactions on Communications.

[8]  Anthony Ephremides,et al.  Information freshness and popularity in mobile caching , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[9]  Di Yuan,et al.  Optimal Scheduling of Age-centric Caching: Tractability and Computation , 2020, ArXiv.

[10]  Jing Yang,et al.  When to preempt? Age of information minimization under link capacity constraint , 2018, Journal of Communications and Networks.

[11]  Roy D. Yates,et al.  Real-time status: How often should one update? , 2012, 2012 Proceedings IEEE INFOCOM.

[12]  Emil Björnson,et al.  Optimal Resource Allocation in Coordinated Multi-Cell Systems , 2013, Found. Trends Commun. Inf. Theory.

[13]  Roy D. Yates,et al.  Age-optimal constrained cache updating , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[14]  Jian Song,et al.  Scheduling to Minimize Age of Synchronization in Wireless Broadcast Networks with Random Updates , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).