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

September 12, 2019 Β· Declared Dead Β· πŸ› International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Haoyue Tang, Philippe Ciblat, Jintao Wang, Michele Wigger, Roy Yates arXiv ID 1909.05930 Category cs.IT: Information Theory Citations 46 Venue International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks Last Checked 6 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted