队列网络中的信息时代（CS P）---蔡秋纯

我们给出了在具有多类更新包的指数外生间隔和所有节点的指数服务时间的准可逆队列无超限网络中，如何计算信息龄的方法。结果提供了任意数量的M/M/1先到先得（FCFS）队列，以及具有两类更新包、通过网络中的不同队列进入和通过同一队列退出的网络。该结果可推广到其它已知逗留时间分布的准可逆队列，如M/M/c-FCFS队列和处理器共享队列。

原文标题：Age of Information in a network of queues

原文：We show how to calculate the Age of Information in an overtake-free network of quasi-reversible queues, with exponential exogenous interarrivals of multiple classes of update packets and exponential service times at all nodes. Results are provided for any number of M/M/1 First-Come-First-Served (FCFS) queues in tandem, and for a network with two classes of update packets, entering through different queues in the network and exiting through the same queue. The results are extensible for other quasi-reversible queues for which sojourn time distributions are known, such as M/M/c FCFS queues and processor-sharing queues.

原文作者：Ioannis Koukoutsidis

原文地址：https://arxiv.org/abs/2005.13788