We study age of information in multi-hop multi-cast cache-enabled networks where the inter-update times on the links are not necessarily exponentially distributed. We focus on the set of non-arithmetic distributions for inter-update times, which includes continuous probability distributions as a subset. We first characterize instantaneous age of information at each node for arbitrary networks. We then explicate the recursive equations for instantaneous age of information in multi-hop networks and derive closed form expressions for expected age of information at an end-user. We show that expected age in multi-hop networks exhibits an additive structure. Further, we show that the expected age at each user is directly proportional to the variance of inter-update times at all links between a user and the source. We expect the analysis in this work to help alleviate the over-dependence on Poisson processes for future work in age of information.
翻译:我们研究多光速多光速多光速、多光速、多光速、缓存功能网络的信息年限,其中链接的间隔时间不一定指数化分布。我们注重一组互换时间的非自动分布,其中包括连续概率分布作为子集。我们首先将每个节点的信息瞬时年龄描述为任意网络。然后将多光速网络信息瞬时年龄的循环方程式复制为多光速网络的信息瞬时年代,并为终端用户的信息预期年龄生成封闭形式表达。我们显示多光速网络的预期年龄显示出一个添加结构。此外,我们显示每个用户的预期年龄与用户和源头之间所有链接的间隔时间差异直接成正比。我们期望这项工作的分析有助于减轻信息时代未来工作对Poisson进程的过度依赖。