arXiv subjects

Michael Zazanis

Publications and source records attributed to Michael Zazanis.

3 recordsLinked to original sources

arXiv2021

Age of Information for Small Buffer Systems

Consider a message processing system whose objective is to produce the most current information as measured by the quantity known as "age of information". We have argued in previous papers that if we are allowed to design the message processing policy ad libitum, we should keep a small buffer and operate according to a LIFO policy. In this small note we provide an analysis for the AoI of the P_m system which uses a buffer of size m, a single server, operating without service preemption and in a LIFO manner for stored messages. Analytical expressions for the mean (or even distribution) of the AoI in steady-state are possible but with the aid computer algebra. We explain the the analysis for m=3.

cs.PF↗

arXiv2020

The distribution of age-of-information performance measures for message processing systems

The idea behind the recently introduced "age of information" performance measure of a networked message processing system is that it indicates our knowledge regarding the "freshness" of the most recent piece of information that can be used as a criterion for real-time control. In this foundational paper, we examine two such measures, one that has been extensively studied in the recent literature and a new one that could be more relevant from the point of view of the processor. Considering these measures as stochastic processes in a stationary environment (defined by the arrival processes, message processing times and admission controls in bufferless systems), we characterize their distributions using the Palm inversion formula. Under renewal assumptions we derive explicit solutions for their Laplace transforms and show some interesting decomposition properties. Previous work has mostly focused on computation of expectations in very particular cases. We argue that using bufferless or very small buffer systems is best and support this by simulation. We also pose some open problems including assessment of enqueueing policies that may be better in cases where one wishes to minimize more general functionals of the age of information measures.

cs.PF↗

arXiv2018

Relative Age of Information: Maintaining Freshness while Considering the Most Recently Generated Information

A queueing system handling a sequence of message arrivals is considered where each message obsoletes all previous messages. The objective is to assess the freshness of the latest message/information that has been successfully transmitted, i.e., "age of information" (AoI). We study a variation of traditional AoI, the "Relative AoI", here defined so as to account for the presence of newly arrived messages/information to the queue to be transmitted.

cs.PF↗