Queuing Systems with Multiple FBM-Based Traffic Models

Authors

Mihaela Teodora Matache, University of Nebraska at OmahaFollow
Valentin Matache, University of Nebraska at OmahaFollow

Document Type

Article

Publication Date

2005

Publication Title

ANZIAM Journal

Volume

46

Issue

2005

First Page

361

Last Page

377

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.

Comments

© Australian Mathematical Society

Matache, M. T., & Matache, V. (2005). Queuing systems for multiple FBM-based traffic models. ANZIAM J, 46(3), 361-377.

Recommended Citation

Matache, Mihaela Teodora and Matache, Valentin, "Queuing Systems with Multiple FBM-Based Traffic Models" (2005). Mathematics Faculty Publications. 15.
https://digitalcommons.unomaha.edu/mathfacpub/15