论文标题
优先级的状态更新：词典最优性
Status Updates with Priorities: Lexicographic Optimality
论文作者
论文摘要
在本文中，我们考虑了一个传输调度问题，其中几种具有不同优先级级别的状态更新数据包通过共享渠道发送到其目的地。我们介绍了词典年龄最优性或简单地说明术语的概念，以评估多级状态更新策略的性能。特别是，Lex-Age-Aftimal调度策略首先最大程度地减少了高优先级流的信息时代（AOI）指标，然后在高优先级流的最佳策略中实现了低优位流的最低AOI指标。我们提出了一种新的调度策略，名为Preemptive优先级，最大年龄，最后生成的，首先提供的（PP-MAF-LGFS），并证明PP-MAF-LGFS调度策略是Lex-age-age-optimal。该结果（i）可最大程度地限制任何时间依赖性，对称和非降低年龄惩罚函数； （ii）最小化由年龄惩罚函数形成的随机过程的任何非降低功能； （iii）对于不同的优先级类具有不同到达的交通模式，年龄惩罚功能和年龄惩罚功能的情况。例如，PP-MAF-LGFS调度策略是最小化高优先级流的平均峰值年龄和低优先级流的时间平均年龄的最佳时代。提供数值结果以说明我们的理论发现。
In this paper, we consider a transmission scheduling problem, in which several streams of status update packets with diverse priority levels are sent through a shared channel to their destinations. We introduce a notion of Lexicographic age optimality, or simply lex-age-optimality, to evaluate the performance of multi-class status update policies. In particular, a lex-age-optimal scheduling policy first minimizes the Age of Information (AoI) metrics for high-priority streams, and then, within the set of optimal policies for high-priority streams, achieves the minimum AoI metrics for low-priority streams. We propose a new scheduling policy named Preemptive Priority, Maximum Age First, Last-Generated, First-Served (PP-MAF-LGFS), and prove that the PP-MAF-LGFS scheduling policy is lex-age-optimal. This result holds (i) for minimizing any time-dependent, symmetric, and non-decreasing age penalty function; (ii) for minimizing any non-decreasing functional of the stochastic process formed by the age penalty function; and (iii) for the cases where different priority classes have distinct arrival traffic patterns, age penalty functions, and age penalty functionals. For example, the PP-MAF-LGFS scheduling policy is lex-age-optimal for minimizing the mean peak age of a high-priority stream and the time-average age of a low-priority stream. Numerical results are provided to illustrate our theoretical findings.
