当前位置: X-MOL 学术J. Commun. Netw. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Anti-aging scheduling in single-server queues: A systematic and comparative study
Journal of Communications and Networks ( IF 2.9 ) Pub Date : 2021-04-16 , DOI: 10.23919/jcn.2021.000005
Zhongdong Liu , Liang Huang , Bin Li , Bo Ji

The age of information (AoI) is a new performance metric recently proposed for measuring the freshness of information in information-update systems. In this work, we conduct a systematic and comparative study to investigate the impact of scheduling policies on the AoI performance in single-server queues and provide useful guidelines for the design of AoI-efficient scheduling policies. Specifically, we first perform extensive simulations to demonstrate that the update-size information can be leveraged for achieving a substantially improved AoI compared to non-size-based (orarrival-time-based) policies. Then, by utilizing both the update-size and arrival-time information, we propose three AoI-based policies. Observing improved AoI performance of policies that allow service preemption and that prioritize informative updates, we further propose preemptive, informative, AoI-based scheduling policies. Our simulation results show that such policies empirically achieve the best AoI performance among all the considered policies. However, compared to the best delay-efficient policies (such as shortest remaining processing time (SRPT)), the AoI improvement is rather marginal in the settings with exogenous arrivals. Interestingly, we also prove sample-path equivalence between some size-based policies and AoI-based policies. This provides an intuitive explanation for why some size-based policies (such as SRPT) achieve a very good AoI performance.

中文翻译:

单服务器队列中的抗老化调度:系统的比较研究

信息寿命(AoI)是最近提出的一种新的性能指标,用于测量信息更新系统中信息的新鲜度。在这项工作中,我们进行了系统的比较研究,以研究调度策略对单服务器队列中AoI性能的影响,并为设计AoI高效的调度策略提供有用的指导。具体来说,我们首先进行广泛的模拟,以证明与不基于大小(基于到达时间)的策略相比,可以利用更新大小信息来实现显着改善的AoI。然后,通过利用更新大小和到达时间信息,我们提出了三种基于AoI的策略。观察到策略的AoI性能得到改善,这些策略允许抢占服务并优先提供信息更新,我们进一步提出了基于AoI的抢占式,信息性调度策略。我们的仿真结果表明,这些策略在所有考虑的策略中凭经验实现了最佳的AoI性能。但是,与最佳的延迟有效策略(例如最短的剩余处理时间(SRPT))相比,在具有外来到达的设置中,AoI的改善是微不足道的。有趣的是,我们还证明了一些基于大小的策略和基于AoI的策略之间的样本路径等效性。这为为什么某些基于大小的策略(例如SRPT)实现了非常好的AoI性能提供了直观的解释。与最佳的延迟有效策略(例如最短的剩余处理时间(SRPT))相比,在有外来到达的情况下,AoI的改善是微不足道的。有趣的是,我们还证明了一些基于大小的策略和基于AoI的策略之间的样本路径等效性。这为为什么某些基于大小的策略(例如SRPT)实现了非常好的AoI性能提供了直观的解释。与最佳的延迟有效策略(例如最短的剩余处理时间(SRPT))相比,在有外来到达的情况下,AoI的改善是微不足道的。有趣的是,我们还证明了一些基于大小的策略和基于AoI的策略之间的样本路径等效性。这为为什么某些基于大小的策略(例如SRPT)实现了非常好的AoI性能提供了直观的解释。
更新日期:2021-05-18
down
wechat
bug