DeepAI AI Chat
Log In Sign Up

Age of Information in an Overtake-Free Network of Quasi-Reversible Queues

05/28/2020
by   Ioannis Koukoutsidis, et al.
0

We show how to calculate the Age of Information in an overtake-free network of quasi-reversible queues, with exponential exogenous interarrivals of multiple classes of update packets and exponential service times at all nodes. Results are provided for any number of M/M/1 First-Come-First-Served (FCFS) queues in tandem, and for a network with two classes of update packets, entering through different queues in the network and exiting through the same queue. The main takeaway is that in a network with different classes of update packets, individual classes roughly preserve the ages they would achieve if they were alone in the network, except when shared queues become saturated, in which case the ages increase considerably. The results are extensible for other quasi-reversible queues for which sojourn time distributions are known, such as M/M/c FCFS queues and processor-sharing queues.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/28/2019

Towards Assigning Priorities in Queues Using Age of Information

We consider a priority queueing system where a single processor serves k...
02/05/2020

Age of Information in a Decentralized Network of Parallel Queues with Routing and Packets Losses

The paper deals with Age of Information in a network of multiple sources...
03/31/2020

On Age and Value of Information in Status Update Systems

Motivated by the inherent value of packets arising in many cyber-physica...
05/17/2022

Susceptibility of Age of Gossip to Timestomping

We consider a fully connected network consisting of a source that mainta...
06/12/2018

Reversible Codes and Its Application to Reversible DNA Codes over F_4^k

Coterm polynomials are introduced by Oztas et al. [a novel approach for ...
05/06/2019

Age of Information Scaling in Large Networks with Hierarchical Cooperation

Given n randomly located source-destination (S-D) pairs on a fixed area ...
05/04/2022

Separations in Proof Complexity and TFNP

It is well-known that Resolution proofs can be efficiently simulated by ...