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

IEEE-ACM TRANSACTIONS ON NETWORKING(2024)

引用 0|浏览0
暂无评分
摘要
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.
更多
查看译文
关键词
Delays,Minimization,Indexes,Random processes,Optimal scheduling,Information age,Costs,Age-of-information,semi-Markov decision process,two-way delay,network scheduling,update through queues
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要