Paper Info
Title
Age of Information in an Overtake- Free Network of Quasi - Reversible Queues
Abstract
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.
Year
DOI
Venue
2020
10.1109/MASCOTS50786.2020.9285958
2020 28th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)
Keywords
DocType
ISSN
Age of Information,queueing network,quasi-reversibility,overtake-free path
Conference
1526-7539
ISBN
Citations 
PageRank 
978-1-7281-9239-0
0
0.34
References 
Authors
0
1
Name
Order
Citations
PageRank
Ioannis Z. Koukoutsidis1158.16