Analysis of single server queueing systems with heavy tail distributions

Heavy tail distributions serve as better models in today's high speed communication networks, where the traffic is heterogeneous in nature. It has been asserted that these distributions do not have closed form for their Laplace transforms, hence classical queueing models can not be applied. A little is known about exact solutions of queueing systems with heavy tail distributions. In this paper it has been shown that the exact expressions for the Laplace transforms of some heavy tail distributions can be obtained with little attempt and these expressions offer exact analysis of queueing systems using classical queueing models. A simulator has been developed to verify the analytical results