Exact Analytical Model of Age of Information in Multi-source Status Update Systems with Per-source Queueing
share
We consider an information update system consisting of N sources sending status packets at random instances according to a Poisson process to a remote monitor through a single server. We assume a heteregeneous server with exponentially distributed service times which is equipped with a waiting room holding the freshest packet from each source referred to as Single Buffer Per-Source Queueing (SBPSQ). The sources are assumed to be equally important, i.e., non-weighted average AoI is used as the information freshness metric, and subsequently two symmetric scheduling policies are studied in this paper, namely First Source First Serve (FSFS) and the Earliest Served First Serve (ESFS) policies, the latter policy being proposed the first time in the current paper to the best of our knowledge. By employing the theory of Markov Fluid Queues (MFQ), an analytical model is proposed to obtain the exact distribution of the Age of Information (AoI) for each source when the FSFS and ESFS policies are employed at the server. Subsequently, a benchmark scheduling-free scheme named as Single Buffer with Replacement (SBR) that uses a single one-packet buffer shared by all sources is also studied with a similar but less complex analytical model. We comparatively study the performance of the three schemes through numerical examples and show that the proposed ESFS policy outperforms the other two schemes in terms of the average AoI and the age violation probability averaged across all sources, in a scenario of sources possessing different traffic intensities but sharing a common service time.
READ FULL TEXT