2023/09/30 by Yin Sun, Sun, Yin, Sastry Kompella +1
Computer Science · Engineering · Psychology · #Age of Information Optimization #Cognitive Functions and Memory #FOS: Computer and information sciences #FOS: Electrical engineering #Information Theory (cs.IT) #IoT Networks and Protocols #Networking and Internet Architecture (cs.NI) #Performance (cs.PF) #Social and Information Networks (cs.SI) #Systems and Control (eess.SY) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.2310.00243
openalex publication_date 2023/09/30 · openalex created_date 2023/10/05 · openalex updated_date 2026/07/28
In this paper, we study an age of information minimization problem in continuous-time and discrete-time status updating systems that involve multiple packet flows, multiple servers, and transmission errors. Four scheduling policies are proposed. We develop a unifying sample-path approach and use it to show that, when the packet generation and arrival times are synchronized across the flows, the proposed policies are (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.