A General Formula for the Stationary Distribution of the Age of Information and Its Application to Single-Server Queues

DOI10.1109/TIT.2019.2938171zbMATH Open1433.94040arXiv1804.06139OpenAlexW3106385712MaRDI QIDQ5211577FDOQ5211577

Authors: Yoshiaki Inoue, Hiroyuki Masuyama, Tetsuya Takine, Toshiyuki Tanaka 

Publication date: 28 January 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: This paper considers the stationary distribution of the age of information (AoI) in information update systems. We first derive a general formula for the stationary distribution of the AoI, which holds for a wide class of information update systems. The formula indicates that the stationary distribution of the AoI is given in terms of the stationary distributions of the system delay and the peak AoI. To demonstrate its applicability and usefulness, we analyze the AoI in single-server queues with four different service disciplines: first-come first-served (FCFS), preemptive last-come first-served (LCFS), and two variants of non-preemptive LCFS service disciplines. For the FCFS and the preemptive LCFS service disciplines, the GI/GI/1, M/GI/1, and GI/M/1 queues are considered, and for the non-preemptive LCFS service disciplines, the M/GI/1 and GI/M/1 queues are considered. With these results, we further show comparison results for the mean AoI's in the M/GI/1 and GI/M/1 queues under those service disciplines.

Full work available at URL: https://arxiv.org/abs/1804.06139

Recommendations

• Stationary queue-length and waiting-time distributions in single-server feedback queues
• An Invariance Relation and a Unified Method to Derive Stationary Queue-Length Distributions
• The age of the arrival process in the G/M/1 and M/G/1 queues
• Stationary distribution of queue length in multiserver priority queueing systems
• On the rate of convergence to the stationary distribution in the single-server queuing systems
• Estimating the stationary distribution in a \(GI/M/1\)-queue
• On the stationary workload distribution of work-conserving single-server queues: A general formula via stochastic intensity
• scientific article

Mathematics Subject Classification ID

Information theory (general) (94A15) Queueing theory (aspects of probability theory) (60K25)

Cited In (2)

• Age of information using Markov-renewal methods
• Discrete time Markov chain model for age of information

This page was built for publication: A General Formula for the Stationary Distribution of the Age of Information and Its Application to Single-Server Queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211577)