Article ID: | iaor2004812 |
Country: | Netherlands |
Volume: | 36 |
Issue: | 1/3 |
Start Page Number: | 243 |
End Page Number: | 267 |
Publication Date: | Nov 2000 |
Journal: | Queueing Systems |
Authors: | Sidi Moshe, Starobinski David |
Keywords: | communications, networks |
We propose a new methodology for modeling and analyzing power-tail distributions, such as the Pareto distribution, in communication networks. The basis of our approach is a fitting algorithm which approximates a power-tail distribution by a hyperexponential distribution. This algorithm possesses several key properties. First, the approximation can be achieved within any desired degree of accuracy. Second, the fitted hyperexponential distribution depends only on a few parameters. Third, only a small number of exponentials are required in order to obtain an accurate approximation over many time scales. Once equipped with a fitted hyperexponential distribution, we have an integrated framework for analyzing queueing systems with power-tail distributions. We consider the