Simple bounds for queues fed by Markovian sources: a tool for performance evaluation

McGurk, Brian and Russell, R. (1997) Simple bounds for queues fed by Markovian sources: a tool for performance evaluation. (Preprint)

Share :
Mastodon Twitter Facebook Email

[thumbnail of DIAS-STP-97-19.pdf] Text
DIAS-STP-97-19.pdf

Download (655kB)

Abstract

ATM traffic is complex but only simple statistical models are amenable to mathematical analysis. We discuss a class of queuing models which is wide enough to provide models which can reflect the features of real traffic, but which is simple enough to be analytically tractable, and review the bounds on the queue-length distribution that have been obtained. We use them to obtain bounds on QoS parameters and to give approximations to the effective bandwidth of such sources. We present some numerical techniques for calculating the bounds efficiently and describe an implementation of them in a computer package which can serve as a tool for qualitative investigations of performance in queuing systems.

Item Type: Article
Divisions: School of Theoretical Physics > Preprints
Date Deposited: 19 Jun 2018 14:07
Last Modified: 15 Dec 2022 08:43
URI: https://dair.dias.ie/id/eprint/678

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year