Loading…

Performance analysis of a Poisson–Pareto queue over the full range of system parameters

There have been many queuing analyses for a single server queue fed by an M/G/ ∞ traffic process, in which G is a Pareto distribution, that focus on certain limiting conditions. In this paper we enhance the so-called Quasi-Stationary (QS) approximation – a queuing analysis introduced previously that...

Full description

Saved in:
Bibliographic Details
Published in:Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2009-05, Vol.53 (7), p.1099-1113
Main Authors: Addie, Ronald G., Neame, Timothy D., Zukerman, Moshe
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:There have been many queuing analyses for a single server queue fed by an M/G/ ∞ traffic process, in which G is a Pareto distribution, that focus on certain limiting conditions. In this paper we enhance the so-called Quasi-Stationary (QS) approximation – a queuing analysis introduced previously that provides an algorithm for computation of an accurate approximation for the stationary queue distribution, applicable to the entire range of system parameters. By numerical evaluation of the QS approximation and the asymptotic approximations (large buffer, many sources, and heavy traffic) over an extremely wide range of parameter values we are able to graphically display consistency of the QS approximation with all the asymptotic results. We demonstrate that the accuracy of the asymptotic approximations is satisfactory only in limited regions of the system parameter space.
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2008.12.016