Gaussian tandem queues with an application to dimensioning of switch fabric interfaces

Michael Mandjes, Petteri Mannersalo, Ilkka Norros

Research output: Contribution to journalArticleScientificpeer-review

7 Citations (Scopus)

Abstract

Tandem systems are seen in many places and at various hierarchical levels in high-speed communication networks, from router architectures to protocol stacks. If the traffic fed into the system is generated by independent or weakly dependent sources and the smallest relevant time scale is not too fine, the central limit theorem suggests that the input traffic is (close to) Gaussian.

This paper considers tandem queues fed by Gaussian processes with stationary increments. Relying on the generalized version of Schilder’s sample-path large-deviations theorem, we derive the many-sources asymptotics of the overflow probabilities in the second queue; ‘Schilder’ reduces this problem to finding the most probable path along which the second queue reaches overflow. The general form of these paths is described by recently obtained results on infinite-intersections of events in Gaussian processes; for the special cases of fractional Brownian motion and integrated Ornstein–Uhlenbeck input, the most probable path can be explicitly determined, as well as the corresponding exponential decay rate.

As the computation of the decay rate is numerically involved, we introduce an explicit approximation (‘rough full-link approximation’). Based on this approximation, we propose performance formulae for network provisioning purposes. Simulation is used to assess the accuracy of the formulae. As an example, we show how the methods can be applied to dimensioning the interface between a line card and a switch fabric.
Original languageEnglish
Pages (from-to)781-797
JournalComputer Networks
Volume51
Issue number3
DOIs
Publication statusPublished - 2007
MoE publication typeA1 Journal article-refereed

Fingerprint

Brownian movement
Routers
Telecommunication networks
Switches

Keywords

  • tandem queue
  • Gaussian processes
  • large deviations
  • performance formulae
  • high-speed communication networks
  • queueing theory
  • priority queue
  • fractional Brownian motion

Cite this

Mandjes, Michael ; Mannersalo, Petteri ; Norros, Ilkka. / Gaussian tandem queues with an application to dimensioning of switch fabric interfaces. In: Computer Networks. 2007 ; Vol. 51, No. 3. pp. 781-797.
@article{9c8757ada5dc46b3bf8f236806369504,
title = "Gaussian tandem queues with an application to dimensioning of switch fabric interfaces",
abstract = "Tandem systems are seen in many places and at various hierarchical levels in high-speed communication networks, from router architectures to protocol stacks. If the traffic fed into the system is generated by independent or weakly dependent sources and the smallest relevant time scale is not too fine, the central limit theorem suggests that the input traffic is (close to) Gaussian.This paper considers tandem queues fed by Gaussian processes with stationary increments. Relying on the generalized version of Schilder’s sample-path large-deviations theorem, we derive the many-sources asymptotics of the overflow probabilities in the second queue; ‘Schilder’ reduces this problem to finding the most probable path along which the second queue reaches overflow. The general form of these paths is described by recently obtained results on infinite-intersections of events in Gaussian processes; for the special cases of fractional Brownian motion and integrated Ornstein–Uhlenbeck input, the most probable path can be explicitly determined, as well as the corresponding exponential decay rate.As the computation of the decay rate is numerically involved, we introduce an explicit approximation (‘rough full-link approximation’). Based on this approximation, we propose performance formulae for network provisioning purposes. Simulation is used to assess the accuracy of the formulae. As an example, we show how the methods can be applied to dimensioning the interface between a line card and a switch fabric.",
keywords = "tandem queue, Gaussian processes, large deviations, performance formulae, high-speed communication networks, queueing theory, priority queue, fractional Brownian motion",
author = "Michael Mandjes and Petteri Mannersalo and Ilkka Norros",
year = "2007",
doi = "10.1016/j.comnet.2006.06.006",
language = "English",
volume = "51",
pages = "781--797",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "3",

}

Gaussian tandem queues with an application to dimensioning of switch fabric interfaces. / Mandjes, Michael; Mannersalo, Petteri; Norros, Ilkka.

In: Computer Networks, Vol. 51, No. 3, 2007, p. 781-797.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Gaussian tandem queues with an application to dimensioning of switch fabric interfaces

AU - Mandjes, Michael

AU - Mannersalo, Petteri

AU - Norros, Ilkka

PY - 2007

Y1 - 2007

N2 - Tandem systems are seen in many places and at various hierarchical levels in high-speed communication networks, from router architectures to protocol stacks. If the traffic fed into the system is generated by independent or weakly dependent sources and the smallest relevant time scale is not too fine, the central limit theorem suggests that the input traffic is (close to) Gaussian.This paper considers tandem queues fed by Gaussian processes with stationary increments. Relying on the generalized version of Schilder’s sample-path large-deviations theorem, we derive the many-sources asymptotics of the overflow probabilities in the second queue; ‘Schilder’ reduces this problem to finding the most probable path along which the second queue reaches overflow. The general form of these paths is described by recently obtained results on infinite-intersections of events in Gaussian processes; for the special cases of fractional Brownian motion and integrated Ornstein–Uhlenbeck input, the most probable path can be explicitly determined, as well as the corresponding exponential decay rate.As the computation of the decay rate is numerically involved, we introduce an explicit approximation (‘rough full-link approximation’). Based on this approximation, we propose performance formulae for network provisioning purposes. Simulation is used to assess the accuracy of the formulae. As an example, we show how the methods can be applied to dimensioning the interface between a line card and a switch fabric.

AB - Tandem systems are seen in many places and at various hierarchical levels in high-speed communication networks, from router architectures to protocol stacks. If the traffic fed into the system is generated by independent or weakly dependent sources and the smallest relevant time scale is not too fine, the central limit theorem suggests that the input traffic is (close to) Gaussian.This paper considers tandem queues fed by Gaussian processes with stationary increments. Relying on the generalized version of Schilder’s sample-path large-deviations theorem, we derive the many-sources asymptotics of the overflow probabilities in the second queue; ‘Schilder’ reduces this problem to finding the most probable path along which the second queue reaches overflow. The general form of these paths is described by recently obtained results on infinite-intersections of events in Gaussian processes; for the special cases of fractional Brownian motion and integrated Ornstein–Uhlenbeck input, the most probable path can be explicitly determined, as well as the corresponding exponential decay rate.As the computation of the decay rate is numerically involved, we introduce an explicit approximation (‘rough full-link approximation’). Based on this approximation, we propose performance formulae for network provisioning purposes. Simulation is used to assess the accuracy of the formulae. As an example, we show how the methods can be applied to dimensioning the interface between a line card and a switch fabric.

KW - tandem queue

KW - Gaussian processes

KW - large deviations

KW - performance formulae

KW - high-speed communication networks

KW - queueing theory

KW - priority queue

KW - fractional Brownian motion

U2 - 10.1016/j.comnet.2006.06.006

DO - 10.1016/j.comnet.2006.06.006

M3 - Article

VL - 51

SP - 781

EP - 797

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 3

ER -