Content Based Status Updates

Consider a stream of status updates generated by a source, where each update is of one of two types: priority or ordinary; these updates are to be transmitted through a network to a monitor. We analyze a transmission policy that treats updates depending on their content: ordinary updates are served in a first-come first-served fashion, whereas the priority updates receive preferential treatment. An arriving priority update discards and replaces any currently-in-service priority update, and preempts (with eventual resume) any ordinary update. We model the arrival processes of the two kinds of updates as independent Poisson processes and the service times as two (possibly different rate) exponentials. We find the arrival and service rates under which the system is stable and give closed-form expressions for average peak age and a lower bound on the average age of the ordinary stream. We give numerical results on the average age of both streams and observe the effect of each stream on the age of the other.

[1]  Anthony Ephremides,et al.  Age of information under random updates , 2013, 2013 IEEE International Symposium on Information Theory.

[2]  Rajai Nasser,et al.  Content Based Status Updates , 2020, IEEE Transactions on Information Theory.

[3]  Sabrina Kruger,et al.  Queueing Theory With Applications To Packet Telecommunication , 2016 .

[4]  Eytan Modiano,et al.  Optimizing age-of-information in a multi-class queueing system , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

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

[6]  Roy D. Yates,et al.  On Piggybacking in Vehicular Networks , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

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

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

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

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

[11]  Marian Codreanu,et al.  Age of information with packet management , 2014, 2014 IEEE International Symposium on Information Theory.

[12]  Emre Telatar,et al.  Status updates in a multi-stream M/G/1/1 preemptive queue , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[13]  Roy D. Yates,et al.  Real-time status updating: Multiple sources , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

[15]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[16]  H. J. Zimmermann,et al.  Electronic circuits, signals, and systems , 1960 .

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

[18]  Bixio Rimoldi,et al.  Principles of Digital Communication: A Top-Down Approach , 2016 .