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

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.

Submitted to IEEE Transactions on Information Theory

Cited by in corpus (9)

• Discrete-time Queueing Model of Age of Information with Multiple Information Sources
• Statistical Guarantee Optimization for AoI in Single-Hop and Two-Hop Systems with Periodic Arrivals
• Peak Age of Information in Priority Queueing Systems
• Finding the Exact Distribution of (Peak) Age of Information for Queues of PH/PH/1/1 and M/PH/1/2 Type
• The Multi-Source Preemptive M/PH/1/1 Queue with Packet Errors: Exact Distribution of the Age of Information and Its Peak
• Age of Information in Downlink Systems: Broadcast or Unicast Transmission?
• How should the server sleep? -- Age-energy tradeoff in sleep-wake server systems
• Age of Information Optimization with Preemption Strategies for Correlated Systems
• Is Multichannel Access Useful in Timely Information Update?