Most probable paths and performance formulae for buffers with Gaussian input traffic

Ron Addie, Petteri Mannersalo, Ilkka Norros

Research output: Contribution to journalArticleScientificpeer-review

49 Citations (Scopus)

Abstract

In this paper, performance formulae for a queue serving Gaussian traffic are presented. The main technique employed is motivated by a general form of Schilder's theorem, the large deviation result for Gaussian processes.
Most probable paths leading to a given buffer occupancy are identified. Special attention is given to the case where the sample pams of die Gaussian process are smooth.
The performance approximations are compared with known analytical results or by means of simulation. The approximations appear to be surprisingly accurate.
Original languageEnglish
Pages (from-to)183-196
JournalEuropean Transactions on Telecommunications
Volume13
Issue number3
DOIs
Publication statusPublished - 2002
MoE publication typeA1 Journal article-refereed

Cite this

Addie, Ron ; Mannersalo, Petteri ; Norros, Ilkka. / Most probable paths and performance formulae for buffers with Gaussian input traffic. In: European Transactions on Telecommunications. 2002 ; Vol. 13, No. 3. pp. 183-196.
@article{7aea23e28bc04231921e8b2644b83b12,
title = "Most probable paths and performance formulae for buffers with Gaussian input traffic",
abstract = "In this paper, performance formulae for a queue serving Gaussian traffic are presented. The main technique employed is motivated by a general form of Schilder's theorem, the large deviation result for Gaussian processes. Most probable paths leading to a given buffer occupancy are identified. Special attention is given to the case where the sample pams of die Gaussian process are smooth. The performance approximations are compared with known analytical results or by means of simulation. The approximations appear to be surprisingly accurate.",
author = "Ron Addie and Petteri Mannersalo and Ilkka Norros",
year = "2002",
doi = "10.1002/ett.4460130303",
language = "English",
volume = "13",
pages = "183--196",
journal = "European Transactions on Telecommunications",
issn = "1124-318X",
publisher = "Wiley-Blackwell",
number = "3",

}

Most probable paths and performance formulae for buffers with Gaussian input traffic. / Addie, Ron; Mannersalo, Petteri; Norros, Ilkka.

In: European Transactions on Telecommunications, Vol. 13, No. 3, 2002, p. 183-196.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Most probable paths and performance formulae for buffers with Gaussian input traffic

AU - Addie, Ron

AU - Mannersalo, Petteri

AU - Norros, Ilkka

PY - 2002

Y1 - 2002

N2 - In this paper, performance formulae for a queue serving Gaussian traffic are presented. The main technique employed is motivated by a general form of Schilder's theorem, the large deviation result for Gaussian processes. Most probable paths leading to a given buffer occupancy are identified. Special attention is given to the case where the sample pams of die Gaussian process are smooth. The performance approximations are compared with known analytical results or by means of simulation. The approximations appear to be surprisingly accurate.

AB - In this paper, performance formulae for a queue serving Gaussian traffic are presented. The main technique employed is motivated by a general form of Schilder's theorem, the large deviation result for Gaussian processes. Most probable paths leading to a given buffer occupancy are identified. Special attention is given to the case where the sample pams of die Gaussian process are smooth. The performance approximations are compared with known analytical results or by means of simulation. The approximations appear to be surprisingly accurate.

U2 - 10.1002/ett.4460130303

DO - 10.1002/ett.4460130303

M3 - Article

VL - 13

SP - 183

EP - 196

JO - European Transactions on Telecommunications

JF - European Transactions on Telecommunications

SN - 1124-318X

IS - 3

ER -