How Useful Is Delayed Feedback in AoI Minimization — A Study on Systems With Queues in Both Forward and Backward Directions

Chih-Chun Wang
{"title":"How Useful Is Delayed Feedback in AoI Minimization — A Study on Systems With Queues in Both Forward and Backward Directions","authors":"Chih-Chun Wang","doi":"10.1109/ISIT50566.2022.9834697","DOIUrl":null,"url":null,"abstract":"One canonical example of Age-Of-Information (AoI) minimization is the update-through-queues models. Existing results fall into two categories: The open-loop setting for which the sender is oblivious of the actual packet departure time, versus the closed-loop setting for which the decision is based on instantaneous Acknowledgement (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 an independent 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 openloop schemes depending on how long the feedback delay is. The results thus quantify the benefits of delayed feedback for AoI minimization in the update-through-queues systems.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT50566.2022.9834697","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

One canonical example of Age-Of-Information (AoI) minimization is the update-through-queues models. Existing results fall into two categories: The open-loop setting for which the sender is oblivious of the actual packet departure time, versus the closed-loop setting for which the decision is based on instantaneous Acknowledgement (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 an independent 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 openloop schemes depending on how long the feedback delay is. The results thus quantify the benefits of delayed feedback for AoI minimization in the update-through-queues systems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
延迟反馈在AoI最小化中的作用——对具有正向和反向队列的系统的研究
信息年龄(Age-Of-Information, AoI)最小化的一个典型示例是通过队列更新模型。现有的结果分为两类:开环设置(发送方不知道实际的数据包出发时间)和闭环设置(决策基于瞬时确认(ACK))。这两种设置都不能完美地反映现代网络系统,因为现代网络系统几乎总是依赖于有一定延迟的反馈。基于这一观察结果,这项工作将ACK流量置于一个独立的队列中,以便基于延迟反馈做出闭环决策。设计了接近最优的调度器,根据反馈延迟的长短,从瞬时ack方案平稳地过渡到开环方案。因此,结果量化了延迟反馈对通过队列更新系统中AoI最小化的好处。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fast Low Rank column-wise Compressive Sensing Ternary Message Passing Decoding of RS-SPC Product Codes Understanding Deep Neural Networks Using Sliced Mutual Information Rate-Optimal Streaming Codes Over the Three-Node Decode-And-Forward Relay Network Unlimited Sampling via Generalized Thresholding
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1