Age of Information in Unreliable Tandem Queues

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Senthilkumar, Muthukrishnan, Dadlani, Aresh, Tabassum, Hina
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912492343525376
author Senthilkumar, Muthukrishnan
Dadlani, Aresh
Tabassum, Hina
author_facet Senthilkumar, Muthukrishnan
Dadlani, Aresh
Tabassum, Hina
contents Stringent demands for timely information delivery, driven by the widespread adoption of real-time applications and the Internet of Things, have established the age of information (AoI) as a critical metric for quantifying data freshness. Existing AoI models often assume multi-hop communication networks with fully reliable nodes, which may not accurately capture scenarios involving node transmission failures. This paper presents an analytical framework for two configurations of tandem queue systems, where status updates generated by a single sensor are relayed to a destination monitor through unreliable intermediate nodes. Using the probability generating function, we first derive the sojourn time distribution for an infinite-buffer M/M/1 tandem system with two unreliable nodes. We then extend our analysis to an M/G/1 tandem system with an arbitrary number of unreliable nodes, employing the supplementary variable technique while assuming that only the first node has an infinite buffer. Numerical results demonstrate the impact of key system parameters on the average AoI in unreliable tandem queues with Markovian and non-Markovian service times.
format Preprint
id arxiv_https___arxiv_org_abs_2506_09245
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Age of Information in Unreliable Tandem Queues
Senthilkumar, Muthukrishnan
Dadlani, Aresh
Tabassum, Hina
Networking and Internet Architecture
Stringent demands for timely information delivery, driven by the widespread adoption of real-time applications and the Internet of Things, have established the age of information (AoI) as a critical metric for quantifying data freshness. Existing AoI models often assume multi-hop communication networks with fully reliable nodes, which may not accurately capture scenarios involving node transmission failures. This paper presents an analytical framework for two configurations of tandem queue systems, where status updates generated by a single sensor are relayed to a destination monitor through unreliable intermediate nodes. Using the probability generating function, we first derive the sojourn time distribution for an infinite-buffer M/M/1 tandem system with two unreliable nodes. We then extend our analysis to an M/G/1 tandem system with an arbitrary number of unreliable nodes, employing the supplementary variable technique while assuming that only the first node has an infinite buffer. Numerical results demonstrate the impact of key system parameters on the average AoI in unreliable tandem queues with Markovian and non-Markovian service times.
title Age of Information in Unreliable Tandem Queues
topic Networking and Internet Architecture
url https://arxiv.org/abs/2506.09245