Exponential Upper Bounds via Martingales for Multiplexers with Markovian Arrivals.

Buffet, E. and Duffield, N. G. (1992) Exponential Upper Bounds via Martingales for Multiplexers with Markovian Arrivals. (Preprint)

Share Twitter Facebook Email

[img] Text
DIAS-STP-92-16.pdf

Download (738kB)

Abstract

We obtain explicit upper bounds in closed form for the queue length in a slotted time FCFS queue in which the service requirement is a sum of independent Markov processes on the state space {O, 1}, with integral service rate. The bound is of the form P[queue length ≥ b] ≤ cy^(-b) for any b ≥ 1 where c < 1 and y > 1 are given explicitly in terms of the parameters of the model. The model can be viewed as an approximation for the burst-level component of the queue in an ATM multiplexer. We obtain heavy traffic bounds for the mean queue length and show that for typical parameters this far exceeds the mean queue length for independent arrivals at the same load. We compare our results on the mean queue length with an analytic expression for the case of unit service rate, and compare our results on the full distribution with computer simulations.

Item Type: Article
Divisions: School of Theoretical Physics > Preprints
Date Deposited: 19 Jun 2018 14:12
Last Modified: 19 Jul 2018 10:33
URI: http://dair.dias.ie/id/eprint/731

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year