Age of Information in a Decentralized Network of Parallel Queues with Routing and Packets Losses
Josu Doncel, Mohamad Assaad

TL;DR
This paper analyzes the Age of Information in a decentralized network of parallel queues with packet losses, providing new bounds and a game-theoretic framework for optimal routing decisions.
Contribution
It derives the average AoI for two queues using SHS, proposes a tight upper bound for multiple queues, and introduces a game-theoretic routing framework with convergence guarantees.
Findings
Derived average AoI for two-queue systems using SHS.
Provided a tight upper bound for AoI in multiple queues.
Developed a game framework for routing decisions with proven convergence.
Abstract
The paper deals with Age of Information (AoI) in a network of multiple sources and parallel queues with buffering capabilities, preemption in service and losses in served packets. The queues do not communicate between each other and the packets are dispatched through the queues according to a predefined probabilistic routing. By making use of the Stochastic Hybrid System (SHS) method, we provide a derivation of the average AoI of a system of two parallel queues (with and without buffer capabilities) and compare the results with those of a single queue. We show that known results of packets delay in Queuing Theory do not hold for the AoI. Unfortunately, the complexity of computing the average AoI using the SHS method increases highly with the number of queues. We therefore provide an upper bound of the average AoI in a system of an arbitrary number of M/M/1/(N+1) queues and show its…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAge of Information Optimization · IoT Networks and Protocols · Distributed systems and fault tolerance
