论文标题
关于惠特尔指数政策的最佳性，以最大程度地减少信息时代
On The Optimality of The Whittle's Index Policy For Minimizing The Age of Information
论文作者
论文摘要
在本文中，我们考虑了平均年龄最小化问题，其中中央实体计划在n个可用用户中使用M用户，以通过不可靠的渠道传输。众所周知，在这种情况下，获得最佳政策是遥不可及的。因此，在较早的著作中提出了Whittle的索引政策，以此作为该问题的启发式方法。但是，对其性能的分析仍然难以捉摸。在续集中，我们克服了这些困难，并就其在多用户制度中的渐近最优性提供了严格的结果。具体来说，我们首先在特定系统状态的附近建立了其最佳性。接下来，我们将证据扩展到在复发假设下的全局情况，我们通过数值验证。这些发现表明，在AOI最小化问题的许多用户制度中，Whittle的指数政策在分析上证明了最佳性。最后，提出了我们的理论发现的数值结果，以证实其性能并证实我们的理论发现。
In this paper, we consider the average age minimization problem where a central entity schedules M users among the N available users for transmission over unreliable channels. It is well-known that obtaining the optimal policy, in this case, is out of reach. Accordingly, the Whittle's index policy has been suggested in earlier works as a heuristic for this problem. However, the analysis of its performance remained elusive. In the sequel, we overcome these difficulties and provide rigorous results on its asymptotic optimality in the many-users regime. Specifically, we first establish its optimality in the neighborhood of a specific system's state. Next, we extend our proof to the global case under a recurrence assumption, which we verify numerically. These findings showcase that the Whittle's index policy has analytically provable optimality in the many-users regime for the AoI minimization problem. Finally, numerical results that showcase its performance and corroborate our theoretical findings are presented.
