论文标题
任意预先无内存网络中的年龄分布
Age Distribution in Arbitrary Preemptive Memoryless Networks
论文作者
论文摘要
我们研究具有无内存服务时间的任意网络中信息时代（AOI）的概率分布。源节点在泊松过程之后生成数据包，然后将数据包在整个网络上转发，以使更新更新更新较旧的数据包。该模型等同于最近由Yates研究的八卦网络，为此，他获得了递归公式，允许对平均AOI进行计算。在本文中，我们获得了网络中每个节点上AOI的固定分布的非常简单的表征。这允许计算年龄的任意功能的平均值。特别是，我们可以计算年龄侵入性概率。此外，我们展示了如何使用简单表征的见解，以实质性地减少某些结构化网络中平均AOI的计算时间。最后，我们描述了如何使用我们的表征来获得更快，更准确的蒙特卡洛模拟，以估计平均AOI或年龄的任意功能的平均值。
We study the probability distribution of age of information (AoI) in arbitrary networks with memoryless service times. A source node generates packets following a Poisson process, and then the packets are forwarded across the network in such a way that newer updates preempt older ones. This model is equivalent to gossip networks that was recently studied by Yates, and for which he obtained a recursive formula allowing the computation for the average AoI. In this paper, we obtain a very simple characterization of the stationary distribution of AoI at every node in the network. This allows for the computation of the average of an arbitrary function of the age. In particular, we can compute age-violation probabilities. Furthermore, we show how it is possible to use insights from our simple characterization in order to substantially reduce the computation time of average AoIs in some structured networks. Finally, we describe how it is possible to use our characterization in order to obtain faster and more accurate Monte Carlo simulations estimating the average AoI, or the average of an arbitrary function of the age.
