On the Age of Information in Single-Server Queues with Aged Updates
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909929884876800 |
|---|---|
| author | Miguelez, Fernando Ayesta, Urtzi Doncel, Josu Ugarte, Maria Dolores |
| author_facet | Miguelez, Fernando Ayesta, Urtzi Doncel, Josu Ugarte, Maria Dolores |
| contents | The Age of Information (AoI) is a performance metric that quantifies the freshness of data in systems where timely updates are critical. Most state-of-the-art methods typically assume that packets enter the monitored system with zero age, neglecting situations, such as those prevalent in multi-hop networks or distributed sensing, where packets experience prior delays. In this paper, the AoI is investigated when packets have a non-zero initial age. We derive an expression for the average AoI in this setting, showing that it equals the standard AoI plus a correction term involving the correlation between packet age and inter-departure times. When these variables are independent, the expression simplifies to an additive correction equal to the mean initial age. In cases where the dependency structure is unknown, we also establish lower and upper bounds for the correction term. We demonstrate the applicability of our approach across various queueing scenarios, such as forwarding, tandem, and retrial queues. Additionally, we explore the accuracy of the derived bounds on a tandem composed of several queues, a model that has not yet been analytically solved from an age perspective. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_19648 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the Age of Information in Single-Server Queues with Aged Updates Miguelez, Fernando Ayesta, Urtzi Doncel, Josu Ugarte, Maria Dolores Information Theory Probability The Age of Information (AoI) is a performance metric that quantifies the freshness of data in systems where timely updates are critical. Most state-of-the-art methods typically assume that packets enter the monitored system with zero age, neglecting situations, such as those prevalent in multi-hop networks or distributed sensing, where packets experience prior delays. In this paper, the AoI is investigated when packets have a non-zero initial age. We derive an expression for the average AoI in this setting, showing that it equals the standard AoI plus a correction term involving the correlation between packet age and inter-departure times. When these variables are independent, the expression simplifies to an additive correction equal to the mean initial age. In cases where the dependency structure is unknown, we also establish lower and upper bounds for the correction term. We demonstrate the applicability of our approach across various queueing scenarios, such as forwarding, tandem, and retrial queues. Additionally, we explore the accuracy of the derived bounds on a tandem composed of several queues, a model that has not yet been analytically solved from an age perspective. |
| title | On the Age of Information in Single-Server Queues with Aged Updates |
| topic | Information Theory Probability |
| url | https://arxiv.org/abs/2506.19648 |