Analysis of the Age of Information with Packet Deadline and Infinite Buffer Capacity

This paper considers the age of information (AoI) in a stationary information update system with packet deadline and infinite buffer capacity which is modeled as an M/G/1+G queue, where the last symbol represents the probability distribution of deadlines. We first characterize the distribution of the AoI in the general case where service times and deadlines are both generally distributed. We next show that this result is dramatically simplified in the M/M/1+G queue. Finally, we consider the M/M/1+D queue, and provide an explicit formula for the mean AoI.