Statistical Age-of-Information Bounds for Parallel Systems: When Do Independent Channels Make a Difference?

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Autoren

Externe Organisationen

  • IMDEA Networks Institute
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Seiten (von - bis)591-606
Seitenumfang16
FachzeitschriftIEEE Journal on Selected Areas in Information Theory
Jahrgang4
PublikationsstatusVeröffentlicht - 31 Okt. 2023

Abstract

This paper contributes tail bounds of the age-of-information of a general class of parallel systems and explores their potential. Parallel systems arise in relevant cases, such as in multi-band mobile networks, multi-technology wireless access, or multi-path protocols, just to name a few. Typically, control over each communication channel is limited and random service outages and congestion cause buffering that impairs the age-of-information. The parallel use of independent channels promises a remedy, since outages on one channel may be compensated for by another. Surprisingly, for the well-known case of MM queues we find the opposite: pooling capacity in one channel performs better than a parallel system with the same total capacity. A generalization is not possible since there are no solutions for other types of parallel queues at hand. In this work, we prove a dual representation of age-of-information in min-plus algebra that connects to queueing models known from the theory of effective bandwidth/capacity and the stochastic network calculus. Exploiting these methods, we derive tail bounds of the age-of-information of GG1 queues. Tail bounds of the age-of-information of independent parallel queues follow readily. In addition to parallel classical queues, we investigate Markov channels where, depending on the memory of the channel, we show the true advantage of parallel systems. We continue to investigate this new finding and provide insight into when capacity should be pooled in one channel or when independent parallel channels perform better. We complement our analysis with simulation results and evaluate different update policies, scheduling policies, and the use of heterogeneous channels that is most relevant for latest multi-band networks.

ASJC Scopus Sachgebiete

Zitieren

Statistical Age-of-Information Bounds for Parallel Systems: When Do Independent Channels Make a Difference? / Fidler, Markus; Champati, Jaya Prakash; Widmer, Joerg et al.
in: IEEE Journal on Selected Areas in Information Theory, Jahrgang 4, 31.10.2023, S. 591-606.

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Fidler M, Champati JP, Widmer J, Noroozi M. Statistical Age-of-Information Bounds for Parallel Systems: When Do Independent Channels Make a Difference? IEEE Journal on Selected Areas in Information Theory. 2023 Okt 31;4:591-606. doi: 10.48550/arXiv.2303.14035, 10.1109/JSAIT.2023.3328766
Fidler, Markus ; Champati, Jaya Prakash ; Widmer, Joerg et al. / Statistical Age-of-Information Bounds for Parallel Systems : When Do Independent Channels Make a Difference?. in: IEEE Journal on Selected Areas in Information Theory. 2023 ; Jahrgang 4. S. 591-606.
Download
@article{640434feea1f466dbd2cbaaf1ebf66a7,
title = "Statistical Age-of-Information Bounds for Parallel Systems: When Do Independent Channels Make a Difference?",
abstract = "This paper contributes tail bounds of the age-of-information of a general class of parallel systems and explores their potential. Parallel systems arise in relevant cases, such as in multi-band mobile networks, multi-technology wireless access, or multi-path protocols, just to name a few. Typically, control over each communication channel is limited and random service outages and congestion cause buffering that impairs the age-of-information. The parallel use of independent channels promises a remedy, since outages on one channel may be compensated for by another. Surprisingly, for the well-known case of MM queues we find the opposite: pooling capacity in one channel performs better than a parallel system with the same total capacity. A generalization is not possible since there are no solutions for other types of parallel queues at hand. In this work, we prove a dual representation of age-of-information in min-plus algebra that connects to queueing models known from the theory of effective bandwidth/capacity and the stochastic network calculus. Exploiting these methods, we derive tail bounds of the age-of-information of GG1 queues. Tail bounds of the age-of-information of independent parallel queues follow readily. In addition to parallel classical queues, we investigate Markov channels where, depending on the memory of the channel, we show the true advantage of parallel systems. We continue to investigate this new finding and provide insight into when capacity should be pooled in one channel or when independent parallel channels perform better. We complement our analysis with simulation results and evaluate different update policies, scheduling policies, and the use of heterogeneous channels that is most relevant for latest multi-band networks.",
keywords = "age-of-information, Communication network performance, multi-band wireless communication, multi-path communication, stochastic network calculus",
author = "Markus Fidler and Champati, {Jaya Prakash} and Joerg Widmer and Mahsa Noroozi",
year = "2023",
month = oct,
day = "31",
doi = "10.48550/arXiv.2303.14035",
language = "English",
volume = "4",
pages = "591--606",

}

Download

TY - JOUR

T1 - Statistical Age-of-Information Bounds for Parallel Systems

T2 - When Do Independent Channels Make a Difference?

AU - Fidler, Markus

AU - Champati, Jaya Prakash

AU - Widmer, Joerg

AU - Noroozi, Mahsa

PY - 2023/10/31

Y1 - 2023/10/31

N2 - This paper contributes tail bounds of the age-of-information of a general class of parallel systems and explores their potential. Parallel systems arise in relevant cases, such as in multi-band mobile networks, multi-technology wireless access, or multi-path protocols, just to name a few. Typically, control over each communication channel is limited and random service outages and congestion cause buffering that impairs the age-of-information. The parallel use of independent channels promises a remedy, since outages on one channel may be compensated for by another. Surprisingly, for the well-known case of MM queues we find the opposite: pooling capacity in one channel performs better than a parallel system with the same total capacity. A generalization is not possible since there are no solutions for other types of parallel queues at hand. In this work, we prove a dual representation of age-of-information in min-plus algebra that connects to queueing models known from the theory of effective bandwidth/capacity and the stochastic network calculus. Exploiting these methods, we derive tail bounds of the age-of-information of GG1 queues. Tail bounds of the age-of-information of independent parallel queues follow readily. In addition to parallel classical queues, we investigate Markov channels where, depending on the memory of the channel, we show the true advantage of parallel systems. We continue to investigate this new finding and provide insight into when capacity should be pooled in one channel or when independent parallel channels perform better. We complement our analysis with simulation results and evaluate different update policies, scheduling policies, and the use of heterogeneous channels that is most relevant for latest multi-band networks.

AB - This paper contributes tail bounds of the age-of-information of a general class of parallel systems and explores their potential. Parallel systems arise in relevant cases, such as in multi-band mobile networks, multi-technology wireless access, or multi-path protocols, just to name a few. Typically, control over each communication channel is limited and random service outages and congestion cause buffering that impairs the age-of-information. The parallel use of independent channels promises a remedy, since outages on one channel may be compensated for by another. Surprisingly, for the well-known case of MM queues we find the opposite: pooling capacity in one channel performs better than a parallel system with the same total capacity. A generalization is not possible since there are no solutions for other types of parallel queues at hand. In this work, we prove a dual representation of age-of-information in min-plus algebra that connects to queueing models known from the theory of effective bandwidth/capacity and the stochastic network calculus. Exploiting these methods, we derive tail bounds of the age-of-information of GG1 queues. Tail bounds of the age-of-information of independent parallel queues follow readily. In addition to parallel classical queues, we investigate Markov channels where, depending on the memory of the channel, we show the true advantage of parallel systems. We continue to investigate this new finding and provide insight into when capacity should be pooled in one channel or when independent parallel channels perform better. We complement our analysis with simulation results and evaluate different update policies, scheduling policies, and the use of heterogeneous channels that is most relevant for latest multi-band networks.

KW - age-of-information

KW - Communication network performance

KW - multi-band wireless communication

KW - multi-path communication

KW - stochastic network calculus

UR - http://www.scopus.com/inward/record.url?scp=85183318910&partnerID=8YFLogxK

U2 - 10.48550/arXiv.2303.14035

DO - 10.48550/arXiv.2303.14035

M3 - Article

AN - SCOPUS:85183318910

VL - 4

SP - 591

EP - 606

JO - IEEE Journal on Selected Areas in Information Theory

JF - IEEE Journal on Selected Areas in Information Theory

ER -

Von denselben Autoren