Optimal AoI for Systems With Queueing Delay in Both Forward and Backward Directions

Age-Of-Information (AoI) is a metric that focuses directly on the application-layer objectives, and a canonical AoI minimization problem is the update-through-queues models. Existing results in this direction fall into two categories: The open-loop setting for which the sender is oblivious of the pa...

Full description

Saved in:
Bibliographic Details
Published inIEEE/ACM transactions on networking Vol. 32; no. 4; pp. 3173 - 3188
Main Author Wang, Chih-Chun
Format Journal Article
LanguageEnglish
Published IEEE 01.08.2024
Subjects
Age-of-information
Costs
Delays
Indexes
Information age
Minimization
network scheduling
Optimal scheduling
Random processes
semi-Markov decision process
two-way delay
update through queues
Online AccessGet full text
ISSN1063-6692
1558-2566
DOI10.1109/TNET.2024.3379895

Cover

More Information
Summary:Age-Of-Information (AoI) is a metric that focuses directly on the application-layer objectives, and a canonical AoI minimization problem is the update-through-queues models. Existing results in this direction fall into two categories: The open-loop setting for which the sender is oblivious of the packet departure time, versus the closed-loop setting for which the decision is based on instantaneous Acknowledgment (ACK). Neither setting perfectly reflects modern networked systems, which almost always rely on feedback that experiences some delay. Motivated by this observation, this work subjects the ACK traffic to a second queue so that the closed-loop decision is made based on delayed feedback. Near-optimal schedulers have been devised, which smoothly transition from the instantaneous-ACK to the open-loop schemes depending on how long the feedback delay is. The results quantify the benefits of delayed feedback for AoI minimization in the update-through-queues systems.
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2024.3379895