In this paper, using the discrete time model, we consider the average age of all files for a cached-files-updating system where a server generates N files and transmits them to a local cache. In order that the cached files are fresh, in each time slot the server updates files with certain probabilities. The age of one file or its age of information (AoI) is defined as the time the file stays in cache since it was last time sent to cache. Assume that each file in cache has corresponding request popularity. In this paper, we obtain the distribution function of the popularity-weighted average age over all files, which gives a complete description of this average age. For the random age of single file, both the mean and its distribution have been derived before by establishing a simple Markov chain. Using the same idea, we show that an N dimensional stochastic process can be constituted to characterize the changes of N file ages simultaneously. By solving the steady-state of the resulting process, we obtain the explicit expression of stationary probability for an arbitrary state-vector. Then, the distribution function of the popularity-weighted average age can be derived by mergering a proper set of stationary probabilities. For the possible applications, the distribution function can be utilized to calculate the probability that the average age violates certain statistical guarantee.
Keywords:
Subject: Engineering - Control and Systems Engineering
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.