arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2111.02309cs.ITcs.NImath.IT
收藏

Pull or Wait:如何优化信息的查询年龄

Pull or Wait: How to Optimize Query Age of Information

M. Emrullah Ildiz, Orhan T. Yavascan, Elif Uysal, O. Tugberk Kartal

摘要:

我们研究了一个基于拉的状态更新通信模型,其中源节点提交更新数据包的信道具有随机的传输延迟,在一个远程目的地节点所要求的时间。我们的目标是最小化的平均查询年龄的信息(QAoI),定义为平均年龄的信息(AoI)在查询时刻发生在目的地侧根据一个随机到达过程中测量。参考文献中定义的基于推的问题公式,其中源随意决定\textit{update or wait},目标是最小化目的地的时间平均AoI,我们将此问题命名为\textit{Pull-or-Wait}(PoW)问题。我们提供了两个公式的比较:(i)在泊松查询到达下,最小化时间平均AoI的最优策略也最小化平均QAoI,并且这些最小值相等;以及(ii)在周期性查询到达下的最优平均QAoI总是小于或等于最优时间平均AoI。我们确定的PoW问题的情况下,一个单一的查询作为一个随机的最短路径(SSP)的问题,不可数的状态和动作空间,这在以前的文献中没有解决。我们推导出这个SSP问题的最佳解决方案,并使用它作为一个积木的解决方案下定期查询到达的PoW问题。

英文摘要:

We study a pull-based status update communication model where a source node submits update packets to a channel with random transmission delay, at times requested by a remote destination node. The objective is to minimize the average query-age-of-information (QAoI), defined as the average age-of-information (AoI) measured at query instants that occur at the destination side according to a stochastic arrival process. In reference to a push-based problem formulation defined in the literature where the source decides to \textit{update or wait} at will, with the objective of minimizing the time average AoI at the destination, we name this problem the \textit{Pull-or-Wait} (PoW) problem. We provide a comparison of the two formulations: (i) Under Poisson query arrivals, an optimal policy that minimizes the time average AoI also minimizes the average QAoI, and these minimum values are equal; and (ii) the optimal average QAoI under periodic query arrivals is always less than or equal to the optimal time average AoI. We identify the PoW problem in the case of a single query as a stochastic shortest path (SSP) problem with uncountable state and action spaces, which has been not solved in previous literature. We derive an optimal solution for this SSP problem and use it as a building block for the solution of the PoW problem under periodic query arrivals.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑