@article{Addie2009Performance,
author = {R. G. Addie and T. D. Neame and M. Zukerman},
title = {Performance analysis of a {Poisson}-{Pareto} queue
over the full range of system parameters},
journal = {Computer Networks},
volume = {53},
number = {7},
pages = {1099-1113},
month = {May},
year = {2009},
abstract = {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 ¨C 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.}
}