Age of Information of Jackson Networks With Finite Buffer Size

摘要

We investigate the Age of Information (AoI) of Jackson Networks with finite buffer size. We provide a closed form expression of an upper bound of the average AoI by using Stochastic Hybrid Systems (SHS) along with linear algebra tools. Since the computation of the bound requires inverting a N x N matrix, where N is the number of queues in the network, we provide a simple iterative algorithm and prove its convergence with geometric convergence rate. Numerical results allow us to assess the accuracy of our model in various settings.