Age-optimal updates of multiple information flows
Authors:
- 1 April 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 136-141
Abstract
In this paper, we study an age of information minimization problem, where multiple flows of update packets are sent over multiple servers to their destinations. Two online scheduling policies are proposed. When the packet generation and arrival times are synchronized across the flows, the proposed policies are shown to be (near) optimal for minimizing any time-dependent, symmetric, and non-decreasing penalty function of the ages of the flows over time in a stochastic ordering sense.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Optimizing data freshness, throughput, and delay in multi-server information-update systems2016
- Update or wait: How to keep your data fresh2016
- On the Age of Information in Status Update Systems With Packet ManagementIEEE Transactions on Information Theory, 2016
- Optimizing age-of-information in a multi-class queueing system2015
- On the universality of age-based scheduling in wireless networks2015
- Real-time status updating: Multiple sources2012
- Performance of multiversion concurrency control algorithms in maintaining temporal consistency2002
- The Achievable Region Approach to the Optimal Control of Stochastic SystemsJournal of the Royal Statistical Society Series B: Statistical Methodology, 1999
- Turnpike Optimality of Smith's Rule in Parallel Machines Stochastic SchedulingMathematics of Operations Research, 1992
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time DisciplineOperations Research, 1968