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

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.

[1]  Roy D. Yates,et al.  The Age of Information: Real-Time Status Updating by Multiple Sources , 2016, IEEE Transactions on Information Theory.

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

[3]  Anthony Ephremides,et al.  On the Age of Information With Packet Deadlines , 2018, IEEE Transactions on Information Theory.

[4]  Charles M. Grinstead,et al.  Introduction to probability , 1999, Statistics for the Behavioural Sciences.

[5]  Roy D. Yates,et al.  Update or wait: How to keep your data fresh , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[6]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

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

[8]  S. Stidham,et al.  Sample-Path Analysis of Queueing Systems , 1998 .

[9]  L. Dworsky.  An Introduction to Probability , 2008 .

[10]  Elif Uysal-Biyikoglu,et al.  Optimal Sampling and Remote Estimation of the Wiener Process over a Channel with Random Delay , 2017, ArXiv.

[11]  N E Manos,et al.  Stochastic Models , 1960, Encyclopedia of Social Network Analysis and Mining. 2nd Ed..

[12]  Stochastic Orders , 2008 .

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

[14]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[15]  Roy D. Yates,et al.  Age of Information: Updates with Priority , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[16]  Anthony Ephremides,et al.  Effect of Message Transmission Path Diversity on Status Age , 2016, IEEE Transactions on Information Theory.

[17]  A. Zemanian.  Distribution Theory and Transform Analysis; An Introduction to Generalized Functions, With Applications , 1965 .

[18]  Vangelis Angelakis,et al.  Age of Information: A New Concept, Metric, and Tool , 2018, Found. Trends Netw..

[19]  P. A. P. Moran,et al.  An introduction to probability theory , 1968 .

[20]  Sلأren Asmussen,et al.  Applied Probability and Queues , 1989 .

[21]  Anthony Ephremides,et al.  Age and value of information: Non-linear age case , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[22]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[23]  François Baccelli,et al.  Elements Of Queueing Theory , 1994 .

[24]  John Gurland.  An Inequality Satisfied by the Expectation of the Reciprocal of a Random Variable , 1967 .

[25]  David M. C. Wishart,et al.  Queuing Systems in Which the Discipline is “Last-Come, First-Served” , 1960 .

[26]  Tetsuya Takine,et al.  A generalization of the decomposition property in the M/G/1 queue with server vacations , 1992, Oper. Res. Lett..

[27]  S. Asmussen,et al.  Applied Probability and Queues , 1989 .

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

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

[30]  Paul J. Schweitzer,et al.  Stochastic Models, an Algorithmic Approach , by Henk C. Tijms (Chichester: Wiley, 1994), 375 pages, paperback. , 1996, Probability in the Engineering and Informational Sciences.

[31]  John Gurland.  The Teacher's Corner: An Inequality Satisfied by the Expectation of the Reciprocal of a Random Variable , 1967 .

[32]  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).

[33]  J. Kingman.  Inequalities in the Theory of Queues , 1970 .

[34]  D. Daley.  Inequalities for moments of tails of random variables, with a queueing application , 1977 .

[35]  A. Zemanian,et al.  Distribution theory and transform analysis , 1966 .