In this paper, we consider the age of information (AoI) of a discrete time status updating system, focusing on finding the stationary AoI distribution assuming that the Ber/G/1/1 queue is used. Following the standard queueing theory, we show that by invoking a two-dimensional state vector which tracks the AoI and packet age in system simultaneously, the stationary AoI distribution can be derived by analyzing the steady state of the constituted two-dimensional stochastic process. We give the general formula of the AoI distribution and calculate the explicit expression when the service time is also geometrically distributed. The discrete and continuous AoI are compared, we depict the mean of discrete AoI and that of continuous time AoI for system with M/M/1/1 queue. Although the stationary AoI distribution of some continuous time single-server system has been determined before, in this paper, we shall prove that the standard queueing theory is still appliable to analyze the discrete AoI, which is even stronger than the proposed methods handling the continuous AoI.
翻译:在本文中,我们考虑一个离散时间状态更新系统的信息年龄(AoI),重点是在使用 Ber/G/1/1 队列的情况下找到固定的 AoI 分布。根据标准的队列理论,我们显示,通过同时在系统中使用跟踪 AoI 和包年龄的二维状态矢量,可以通过分析构成的两维随机化过程的稳定性来得出固定的 AoI 分布。我们给出了AoI 分布的一般公式,并在服务时间也是几何分布时计算清晰的表达式。对离散和连续的 AoI 进行了比较,我们描绘了离散AoI 和与 M/M/1/1 队列系统持续时间AoI 的平均值。虽然以前已经确定了某些连续时间单个服务器系统的固定状态分布,但在本文件中,我们将证明标准排队列理论仍然可以用来分析离散的AoI,这甚至比处理连续的AoI 的方法更强大。