Papers
Topics
Authors
Recent
Search
2000 character limit reached

Age of Information for Discrete Time Queues

Published 28 Jan 2019 in cs.IT and math.IT | (1901.10463v1)

Abstract: Age of information (AoI) is a time-evolving measure of information freshness, that tracks the time since the last received fresh update was generated. Analyzing peak and average AoI, two time average metrics of AoI, for various continuous time queueing systems has received considerable attention. We analyze peak and average age for various discrete time queueing systems. We first consider first come first serve (FCFS) Ber/G/1 and Ber/G/1 queue with vacations, and derive explicit expressions for peak and average age. We also obtain age expressions for the last come first serve (LCFS) queue and the $G/G/\infty$ queue. We build upon proof techniques from earlier results, and also present new techniques that might be of independent interest in analyzing age in discrete time queuing systems.

Citations (52)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.