Cache Updating Strategy Minimizing the Age of Information with Time-Varying Files' Popularities

10/09/2020
by   Haoyue Tang, et al.
0

We consider updating strategies for a local cache which downloads time-sensitive files from a remote server through a bandwidth-constrained link. The files are requested randomly from the cache by local users according to a popularity distribution which varies over time according to a Markov chain structure. We measure the freshness of the requested time-sensitive files through their Age of Information (AoI). The goal is then to minimize the average AoI of all requested files by appropriately designing the local cache's downloading strategy. To achieve this goal, the original problem is relaxed and cast into a Constrained Markov Decision Problem (CMDP), which we solve using a Lagrangian approach and Linear Programming. Inspired by this solution for the relaxed problem, we propose a practical cache updating strategy that meets all the constraints of the original problem. Under certain assumptions, the practical updating strategy is shown to be optimal for the original problem in the asymptotic regime of a large number of files. For a finite number of files, we show the gain of our practical updating strategy over the traditional square-root-law strategy (which is optimal for fixed non time-varying file popularities) through numerical simulations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/12/2019

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 se...
research
12/28/2020

Freshness-Optimal Caching for Information Updating Systems with Limited Cache Storage Capacity

In this paper, we investigate a cache updating system with a server cont...
research
04/20/2020

Information Freshness in Cache Updating Systems

We consider a cache updating system with a source, a cache and a user. T...
research
08/04/2019

Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints

In this paper, we study how to collect fresh data in time-varying networ...
research
06/06/2018

Cache Placement in Two-Tier HetNets with Limited Storage Capacity: Cache or Buffer?

In this paper, we aim to minimize the average file transmission delay vi...
research
05/11/2021

Freshness Based Cache Updating in Parallel Relay Networks

We consider a system consisting of a server, which receives updates for ...

Please sign up or login with your details

Forgot password? Click here to reset