When to Preempt in a Status Update System? (2402.00845v2)
Abstract: We consider a time-slotted status update system with an error-free preemptive queue. The goal of the sampler-scheduler pair is to minimize the age of information at the monitor by sampling and transmitting the freshly sampled update packets to the monitor. The sampler-scheduler pair also has a choice to preempt an old update packet from the server and transmit a new update packet to the server. We formulate this problem as a Markov decision process (MDP) and find the optimal sampling policy. We find a sufficient, and also separately a necessary, condition for the always preemption policy to be an optimal policy. We show that it is optimal for the sampler-scheduler pair to sample a new packet immediately upon the reception of an update packet at the monitor. We propose a double-threshold sampling policy which we show to be an optimal policy under some assumptions on the queue statistic.
- Age of information: A new concept, metric, and tool. Foundations and Trends in Networking, 12(3):162–259, November 2017.
- Age of information: A new metric for information freshness. Synthesis Lectures on Communication Networks, 12(2):1–224, December 2019.
- Age of information: An introduction and survey. IEEE Journal on Selected Areas in Communications, 39(5):1183–1210, May 2021.
- Y. Sun and B. Cyr. Sampling for data freshness optimization: Non-linear age functions. Journal of Communications and Networks, 21(3):204–219, June 2019.
- Optimal sampling and scheduling for timely status updates in multi-source networks. IEEE Transactions on Information Theory, 67(6):4019–4034, February 2021.
- Timely cloud computing: Preemption and waiting. In Allerton Conference on Communication, Control, and Computing, October 2019.
- When to preempt? Age of information minimization under link capacity constraint. Journal of Communications and Networks, 21(3):220–232, June 2019.
- R. D. Yates. Age of information in a network of preemptive servers. In IEEE Infocom, April 2018.
- M. L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, 2014.
- D. Bertsekas. Dynamic Programming and Optimal Control: Volume II. Athena Scientific, 2012.