Queueing systems for multiple FBM-based traffic models

Research output: Contribution to journalArticle

3 Scopus citations

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
Publication statusPublished - Jan 1 2005

    Fingerprint

ASJC Scopus subject areas

  • Mathematics (miscellaneous)

Cite this