Age of Information: Design and Analysis of Optimal Scheduling Algorithms
Name
Yu-Pin-ISIT2017 copy.pdf
Size
499.85 KB
Format
Adobe PDF
Checksum (MD5)
5e785c2435ed7af05e114a03c93b09aa
Author(s)
Hsu, Yu-Pin
Duan, Lingjie
Modiano, Eytan H
Date Issued
November 2016
Journal
2017 IEEE International Symposium on Information Theory (ISIT)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Hsu, Yu-Pin, Eytan Modiano, and Lingjie Duan. “Age of Information: Design and Analysis of Optimal Scheduling Algorithms.” 2017 IEEE International Symposium on Information Theory (ISIT) (June 2017).
Version
Author's final manuscript
Abstract
Abstract:
Age of information is a newly proposed metric that captures delay from an application layer perspective. The age measures the amount of time that elapsed from the moment the mostly recently received update was generated until the present time. In this paper, we study an age minimization problem over a wireless broadcast network with many users, where only one user can be served at a time. We formulate a Markov decision process (MDP) to find dynamic transmission scheduling schemes, with the purpose of minimizing the long-run average age. While showing that an optimal scheduling algorithm for the MDP is a simple stationary switch-type, we propose a sequence of finite-state approximations for our infinite-state MDP and prove its convergence. We then propose both optimal off-line and online scheduling algorithms for the finite-approximate MDPs, depending on knowledge of time-varying arrivals.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2017.8006590
