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.

[1]  F. Baccelli,et al.  Single-server queues with impatient customers , 1984, Advances in Applied Probability.

[2]  Roy D. Yates,et al.  Status updates through M/G/1/1 queues with HARQ , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[3]  P. H. Brill,et al.  Level Crossings in Point Processes Applied to Queues: Single-Server Case , 1977, Oper. Res..

[4]  Ness B. Shroff,et al.  Age-optimal information updates in multihop networks , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[5]  Rajai Nasser,et al.  Age of information: The gamma awakening , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[6]  Robert E. Stanford,et al.  Reneging Phenomena in Single Channel Queues , 1979, Math. Oper. Res..

[7]  Tetsuya Takine,et al.  The stationary distribution of the age of information in FCFS single-server queues , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[8]  Marian Codreanu,et al.  On the Age of Information in Status Update Systems With Packet Management , 2015, IEEE Transactions on Information Theory.

[9]  Ness B. Shroff,et al.  Optimizing data freshness, throughput, and delay in multi-server information-update systems , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[10]  Jacob Cohen,et al.  On up- and downcrossings , 1977, Journal of Applied Probability.

[11]  Anthony Ephremides,et al.  Controlling the age of information: Buffer size, deadline, and packet replacement , 2016, MILCOM 2016 - 2016 IEEE Military Communications Conference.

[12]  Anthony Ephremides,et al.  Age of information with a packet deadline , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[13]  Roy D. Yates,et al.  Status updates through queues , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).

[14]  Tetsuya Takine,et al.  Analysis of the loss probability in the M/G/1+G queue , 2015, Queueing Syst. Theory Appl..

[15]  Roy D. Yates,et al.  Real-time status: How often should one update? , 2012, 2012 Proceedings IEEE INFOCOM.

[16]  I. N. Kovalenko.  Some Queuing Problems with Restrictions , 1961 .

[17]  D. Daley.  General customer impatience in the queue GI/G/ 1 , 1965 .