论文标题
与路由和数据包损失的平行队列的分散网络中的信息年龄
Age of Information in a Decentralized Network of Parallel Queues with Routing and Packets Losses
论文作者
论文摘要
该论文涉及多个来源网络的信息时代（AOI），以及带有缓冲功能的平行队列，服务的抢先和服务数据包中的损失。队列不会在彼此之间进行交流，并且根据预定义的概率路由通过队列派遣数据包。通过使用随机混合系统（SHS）方法，我们提供了两个平行队列系统的平均AOI（具有和不具有缓冲能力）的平均AOI，并将结果与单个队列的结果进行比较。我们表明，排队理论中数据包延迟的已知结果不适合AOI。不幸的是，使用SHS方法计算平均AOI的复杂性随队列数量高度增加。因此，我们在任意数量的m/m/m/1/（n+1）队列的系统中提供平均AOI的上限，并在各种制度中显示其紧密度。该上限允许提供平均AOI的紧密近似，其复杂性非常低。然后，我们提供一个游戏框架，允许每个源可以确定其最佳概率路由决策。通过使用平均现场游戏，我们提供了对路由游戏框架的分析，提出了一种有效的迭代方法，以找到每个源的路由决策，并证明其融合到所需的平衡。
The paper deals with Age of Information (AoI) in a network of multiple sources and parallel queues with buffering capabilities, preemption in service and losses in served packets. The queues do not communicate between each other and the packets are dispatched through the queues according to a predefined probabilistic routing. By making use of the Stochastic Hybrid System (SHS) method, we provide a derivation of the average AoI of a system of two parallel queues (with and without buffer capabilities) and compare the results with those of a single queue. We show that known results of packets delay in Queuing Theory do not hold for the AoI. Unfortunately, the complexity of computing the average AoI using the SHS method increases highly with the number of queues. We therefore provide an upper bound of the average AoI in a system of an arbitrary number of M/M/1/(N+1) queues and show its tightness in various regimes. This upper bound allows providing a tight approximation of the average AoI with a very low complexity. We then provide a game framework that allows each source to determine its best probabilistic routing decision. By using Mean Field Games, we provide an analysis of the routing game framework, propose an efficient iterative method to find the routing decision of each source and prove its convergence to the desired equilibrium.
