论文标题
单人队列中的抗衰老计划：系统和比较研究
Anti-Aging Scheduling in Single-Server Queues: A Systematic and Comparative Study
论文作者
论文摘要
信息年龄（AOI）是最近提出的一种新的性能指标，用于衡量信息更新系统中信息的新鲜度。在这项工作中，我们进行了一项系统的比较研究，以研究调度策略对单人队列中AOI性能的影响，并为设计AOI效率调度策略的设计提供了有用的指南。具体而言，我们首先执行广泛的仿真，以证明可以利用更新大小的信息来实现与非大小（或基于到达时间的）策略相比，可以实现大大改善的AOI。然后，通过使用更新大小和到达时间信息，我们提出了三个基于AOI的策略。观察改善了允许服务先发制人并确定信息优先更新优先级的政策的AOI绩效，我们进一步提出了先发制人的，信息性的基于AOI的调度策略。我们的仿真结果表明，此类政策在经验上实现了所有考虑的政策中的最佳AOI性能。但是，与最好的延迟效率策略（例如最短的处理时间（SRPT））相比，在外源性到达的情况下，AOI的改善相当微不足道。有趣的是，我们还证明了某些基于大小的策略和基于AOI的策略之间的样本路径等效性。这提供了一个直观的解释，说明为什么某些基于尺寸的策略（例如SRPT）实现了非常好的AOI性能。
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 (or arrival-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.
