Queueing systems for multiple FBM-based traffic models

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

A multiple fractional Brownian motion (FBM)-based traffic model is considered. Various lower bounds for the overflow probability of the associated queueing system are obtained. Based on a probabilistic bound for the busy period of an ATM queueing system associated with a multiple FBM-based input traffic, a minimal dynamic buffer allocation function (DBAF) is obtained and a DBAF-allocation algorithm is designed. The purpose is to create an upper bound for the queueing system associated with the traffic. This upper bound, called a DBAF, is a function of time, dynamically bouncing with the traffic. An envelope process associated with the multiple FBM-based traffic model is introduced and used to estimate the queue size of the queueing system associated with that traffic model.

Original languageEnglish (US)
Pages (from-to)361-377
Number of pages17
JournalANZIAM Journal
Volume46
Issue number3
DOIs
StatePublished - Jan 1 2005

Fingerprint

Traffic Model
Buffer Allocation
Fractional Brownian Motion
Queueing System
Traffic
Upper bound
Busy Period
Overflow
Envelope
Queue
Lower bound
Estimate

ASJC Scopus subject areas

  • Mathematics (miscellaneous)

Cite this

Queueing systems for multiple FBM-based traffic models. / Matache, Mihaela T; Matache, Valentin.

In: ANZIAM Journal, Vol. 46, No. 3, 01.01.2005, p. 361-377.

Research output: Contribution to journalArticle

@article{97e5f799f6c84605897f6384a8cb8a55,
title = "Queueing systems for multiple FBM-based traffic models",
abstract = "A multiple fractional Brownian motion (FBM)-based traffic model is considered. Various lower bounds for the overflow probability of the associated queueing system are obtained. Based on a probabilistic bound for the busy period of an ATM queueing system associated with a multiple FBM-based input traffic, a minimal dynamic buffer allocation function (DBAF) is obtained and a DBAF-allocation algorithm is designed. The purpose is to create an upper bound for the queueing system associated with the traffic. This upper bound, called a DBAF, is a function of time, dynamically bouncing with the traffic. An envelope process associated with the multiple FBM-based traffic model is introduced and used to estimate the queue size of the queueing system associated with that traffic model.",
author = "Matache, {Mihaela T} and Valentin Matache",
year = "2005",
month = "1",
day = "1",
doi = "10.1017/S1446181100008312",
language = "English (US)",
volume = "46",
pages = "361--377",
journal = "ANZIAM Journal",
issn = "1446-1811",
publisher = "Cambridge University Press",
number = "3",

}

TY - JOUR

T1 - Queueing systems for multiple FBM-based traffic models

AU - Matache, Mihaela T

AU - Matache, Valentin

PY - 2005/1/1

Y1 - 2005/1/1

N2 - A multiple fractional Brownian motion (FBM)-based traffic model is considered. Various lower bounds for the overflow probability of the associated queueing system are obtained. Based on a probabilistic bound for the busy period of an ATM queueing system associated with a multiple FBM-based input traffic, a minimal dynamic buffer allocation function (DBAF) is obtained and a DBAF-allocation algorithm is designed. The purpose is to create an upper bound for the queueing system associated with the traffic. This upper bound, called a DBAF, is a function of time, dynamically bouncing with the traffic. An envelope process associated with the multiple FBM-based traffic model is introduced and used to estimate the queue size of the queueing system associated with that traffic model.

AB - A multiple fractional Brownian motion (FBM)-based traffic model is considered. Various lower bounds for the overflow probability of the associated queueing system are obtained. Based on a probabilistic bound for the busy period of an ATM queueing system associated with a multiple FBM-based input traffic, a minimal dynamic buffer allocation function (DBAF) is obtained and a DBAF-allocation algorithm is designed. The purpose is to create an upper bound for the queueing system associated with the traffic. This upper bound, called a DBAF, is a function of time, dynamically bouncing with the traffic. An envelope process associated with the multiple FBM-based traffic model is introduced and used to estimate the queue size of the queueing system associated with that traffic model.

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

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

U2 - 10.1017/S1446181100008312

DO - 10.1017/S1446181100008312

M3 - Article

VL - 46

SP - 361

EP - 377

JO - ANZIAM Journal

JF - ANZIAM Journal

SN - 1446-1811

IS - 3

ER -