论文标题
准可逆队列网络中的信息年龄
Age of Information in an Overtake-Free Network of Quasi-Reversible Queues
论文作者
论文摘要
我们展示了如何在准可逆的队列网络中计算信息的年龄，并在所有节点上使用多个更新数据包的多个类别的更新数据包和指数服务时间的指数外源性间外源。提供了任何数量的M/M/1串联的M/M/1首次访问（FCFS）队列的结果，以及具有两类更新数据包的网络，通过网络中的不同队列输入并通过同一队列退出。主要要点是，在具有不同类别的更新数据包的网络中，单个类别大致保留了如果他们一个人在网络中，则可以实现的年龄，除非共享队列变得饱和，在这种情况下，年龄大大增加。
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 main takeaway is that in a network with different classes of update packets, individual classes roughly preserve the ages they would achieve if they were alone in the network, except when shared queues become saturated, in which case the ages increase considerably.
