ANZIAM  J.  46 (2005), 361-377
Queueing systems for multiple FBM-based traffic models

Mihaela T. Matache
  Department of Mathematics
  The University of Nebraska at Omaha
  Omaha, NE 68182
  USA
  dmatache@mail.unomaha.edu
and
Valentin Matache
  Department of Mathematics
  The University of Nebraska at Omaha
  Omaha, NE 68182
  USA
  vmatache@mail.unomaha.edu


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.
Download the article in PDF format (size 332 Kb)

Australian Mathematical Publishing Association Inc. ©  Australian MS