Age-Optimal Updates of Multiple Information Flows
Authors:
Preprint
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 16 references indexed in Scilit:
- Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random ArrivalsIEEE Transactions on Mobile Computing, 2019
- Optimal Link Scheduling for Age Minimization in Wireless SystemsIEEE Transactions on Information Theory, 2017
- Status updates over unreliable multiaccess channels2017
- Optimizing data freshness, throughput, and delay in multi-server information-update systems2016
- On the Age of Information in Status Update Systems With Packet ManagementIEEE Transactions on Information Theory, 2016
- Real-time status updating: Multiple sources2012
- Multi‐Armed Bandit Allocation Indices2011
- Industrial Wireless Sensor Networks: Challenges, Design Principles, and Technical ApproachesIEEE Transactions on Industrial Electronics, 2009
- Time synchronization in sensor networks: a surveyIEEE Network, 2004
- Synchronized sampling and phasor measurements for relaying and controlIEEE Transactions on Power Delivery, 1994