Age-Delay Tradeoffs in Queueing Systems

11/11/2019
by   Rajat Talak, et al.
0

We consider an M server system in which each server can service at most one update packet at a time. The system designer controls (1) scheduling - the order in which the packets get serviced, (2) routing - the server that an arriving update packet joins for service, and (3) the service time distribution with fixed service rate. Given a fixed update generation process, we prove a strong age-delay and age-delay variance tradeoff, wherein, as the average AoI approaches its minimum, the packet delay and its variance approach infinity. In order to prove this result, we consider two special cases of the M server system, namely, a single server system with last come first server with preemptive service and an infinite server system. In both these cases, we derive sufficient conditions to show that three heavy tailed service time distributions, namely Pareto, log-normal, and Weibull, asymptotically minimize the average AoI as their tail gets heavier, and establish the age-delay tradeoff results. We provide an intuitive explanation as to why such a seemingly counter intuitive age-delay tradeoff is natural, and that it should exist in many systems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/14/2019

Age-Delay Tradeoffs in Single Server Systems

Information freshness and low latency communication is important to many...
research
10/10/2018

Can Determinacy Minimize Age of Information?

Age-of-information (AoI) is a newly proposed destination-centric perform...
research
01/09/2019

On the Benefits of Waiting in Status Update Systems

This paper explores the potential of waiting before packet transmission ...
research
04/17/2018

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 informati...
research
05/08/2018

Delay and Peak-Age Violation Probability in Short-Packet Transmissions

This paper investigates the distribution of delay and peak age of inform...
research
05/31/2019

Age of Information in G/G/1/1 Systems: Age Expressions, Bounds, Special Cases, and Optimization

We consider the age of information in G/G/1/1 systems under two service ...
research
09/16/2016

Infinite Server Queueing Networks with Deadline Based Routing

Motivated by timeouts in Internet services, we consider networks of infi...

Please sign up or login with your details

Forgot password? Click here to reset