Queueing behavior under fractional brownian traffic

Ilkka Norros

Research output: Chapter in Book/Report/Conference proceedingChapter or book articleScientificpeer-review

Abstract

This chapter gives an overview of some properties of the storage occupancy process in a buffer fed with “fractional Brownian traffic,” a Gaussian self‐similar process. This model, called here “fractional Brownian storage,” is the logically simplest long‐range‐dependent (LRD) storage system having strictly self‐similar input variation. The impact of the self‐similarity parameter H can be very clearly illustrated with this model. Even in this case, all the known explicitly calculable formulas for quantities like the storage occupancy distribution are only limit results, for example, large deviation asymptotics. Scaling formulas, on the other hand, hold exactly for this model.

The simplicity is won at the price that the input model is not meaningful at the smallest time scales, where half of the “traffic” is negative. The model can be justified by rigorous limit theorems, but it should be emphasized that this involves not only a central limit theorem (CLT) argument for Gaussianity but also a heavy traffic limit. From a less rigorous, practical viewpoint one can say that fractional Brownian storage gives usable results when, at time scales relevant for queueing phenomena, the traffic consists of independent streams such that a large number of them are simultaneously active, and second‐order self‐similarity holds.

This chapter is structured as follows. Definitions are given and then some basic scaling formulas are derived. Results based on large deviations in path space are presented. Finally, some other approaches are outlined.
Original languageEnglish
Title of host publicationSelf-Similar Network Traffic and Performance Evaluation
EditorsKihong Park, Walter Willinger
Place of PublicationCanada
PublisherWiley
Chapter4
Pages101-114
ISBN (Electronic)978-0-471-20644-6
ISBN (Print)0-471-31974-0, 978-0-471-31974-0
DOIs
Publication statusPublished - 2000
MoE publication typeA3 Part of a book or another research book

Fingerprint

Queueing
Fractional
Traffic
Self-similarity
Large Deviations
Time Scales
Scaling
Self-similar Processes
Path Space
Heavy Traffic
Model
Storage System
Limit Theorems
Gaussian Process
Central limit theorem
Buffer
Simplicity
Strictly

Cite this

Norros, I. (2000). Queueing behavior under fractional brownian traffic. In K. Park, & W. Willinger (Eds.), Self-Similar Network Traffic and Performance Evaluation (pp. 101-114). Canada: Wiley. https://doi.org/10.1002/047120644X.ch4
Norros, Ilkka. / Queueing behavior under fractional brownian traffic. Self-Similar Network Traffic and Performance Evaluation. editor / Kihong Park ; Walter Willinger. Canada : Wiley, 2000. pp. 101-114
@inbook{7a293711751d41e09485cf065d3d882a,
title = "Queueing behavior under fractional brownian traffic",
abstract = "This chapter gives an overview of some properties of the storage occupancy process in a buffer fed with “fractional Brownian traffic,” a Gaussian self‐similar process. This model, called here “fractional Brownian storage,” is the logically simplest long‐range‐dependent (LRD) storage system having strictly self‐similar input variation. The impact of the self‐similarity parameter H can be very clearly illustrated with this model. Even in this case, all the known explicitly calculable formulas for quantities like the storage occupancy distribution are only limit results, for example, large deviation asymptotics. Scaling formulas, on the other hand, hold exactly for this model.The simplicity is won at the price that the input model is not meaningful at the smallest time scales, where half of the “traffic” is negative. The model can be justified by rigorous limit theorems, but it should be emphasized that this involves not only a central limit theorem (CLT) argument for Gaussianity but also a heavy traffic limit. From a less rigorous, practical viewpoint one can say that fractional Brownian storage gives usable results when, at time scales relevant for queueing phenomena, the traffic consists of independent streams such that a large number of them are simultaneously active, and second‐order self‐similarity holds.This chapter is structured as follows. Definitions are given and then some basic scaling formulas are derived. Results based on large deviations in path space are presented. Finally, some other approaches are outlined.",
author = "Ilkka Norros",
note = "Project code: T9SU00181",
year = "2000",
doi = "10.1002/047120644X.ch4",
language = "English",
isbn = "0-471-31974-0",
pages = "101--114",
editor = "Kihong Park and Willinger, {Walter }",
booktitle = "Self-Similar Network Traffic and Performance Evaluation",
publisher = "Wiley",
address = "United States",

}

Norros, I 2000, Queueing behavior under fractional brownian traffic. in K Park & W Willinger (eds), Self-Similar Network Traffic and Performance Evaluation. Wiley, Canada, pp. 101-114. https://doi.org/10.1002/047120644X.ch4

Queueing behavior under fractional brownian traffic. / Norros, Ilkka.

Self-Similar Network Traffic and Performance Evaluation. ed. / Kihong Park; Walter Willinger. Canada : Wiley, 2000. p. 101-114.

Research output: Chapter in Book/Report/Conference proceedingChapter or book articleScientificpeer-review

TY - CHAP

T1 - Queueing behavior under fractional brownian traffic

AU - Norros, Ilkka

N1 - Project code: T9SU00181

PY - 2000

Y1 - 2000

N2 - This chapter gives an overview of some properties of the storage occupancy process in a buffer fed with “fractional Brownian traffic,” a Gaussian self‐similar process. This model, called here “fractional Brownian storage,” is the logically simplest long‐range‐dependent (LRD) storage system having strictly self‐similar input variation. The impact of the self‐similarity parameter H can be very clearly illustrated with this model. Even in this case, all the known explicitly calculable formulas for quantities like the storage occupancy distribution are only limit results, for example, large deviation asymptotics. Scaling formulas, on the other hand, hold exactly for this model.The simplicity is won at the price that the input model is not meaningful at the smallest time scales, where half of the “traffic” is negative. The model can be justified by rigorous limit theorems, but it should be emphasized that this involves not only a central limit theorem (CLT) argument for Gaussianity but also a heavy traffic limit. From a less rigorous, practical viewpoint one can say that fractional Brownian storage gives usable results when, at time scales relevant for queueing phenomena, the traffic consists of independent streams such that a large number of them are simultaneously active, and second‐order self‐similarity holds.This chapter is structured as follows. Definitions are given and then some basic scaling formulas are derived. Results based on large deviations in path space are presented. Finally, some other approaches are outlined.

AB - This chapter gives an overview of some properties of the storage occupancy process in a buffer fed with “fractional Brownian traffic,” a Gaussian self‐similar process. This model, called here “fractional Brownian storage,” is the logically simplest long‐range‐dependent (LRD) storage system having strictly self‐similar input variation. The impact of the self‐similarity parameter H can be very clearly illustrated with this model. Even in this case, all the known explicitly calculable formulas for quantities like the storage occupancy distribution are only limit results, for example, large deviation asymptotics. Scaling formulas, on the other hand, hold exactly for this model.The simplicity is won at the price that the input model is not meaningful at the smallest time scales, where half of the “traffic” is negative. The model can be justified by rigorous limit theorems, but it should be emphasized that this involves not only a central limit theorem (CLT) argument for Gaussianity but also a heavy traffic limit. From a less rigorous, practical viewpoint one can say that fractional Brownian storage gives usable results when, at time scales relevant for queueing phenomena, the traffic consists of independent streams such that a large number of them are simultaneously active, and second‐order self‐similarity holds.This chapter is structured as follows. Definitions are given and then some basic scaling formulas are derived. Results based on large deviations in path space are presented. Finally, some other approaches are outlined.

U2 - 10.1002/047120644X.ch4

DO - 10.1002/047120644X.ch4

M3 - Chapter or book article

SN - 0-471-31974-0

SN - 978-0-471-31974-0

SP - 101

EP - 114

BT - Self-Similar Network Traffic and Performance Evaluation

A2 - Park, Kihong

A2 - Willinger, Walter

PB - Wiley

CY - Canada

ER -

Norros I. Queueing behavior under fractional brownian traffic. In Park K, Willinger W, editors, Self-Similar Network Traffic and Performance Evaluation. Canada: Wiley. 2000. p. 101-114 https://doi.org/10.1002/047120644X.ch4