Performance evaluation of a queue fed by a Poisson Pareto burst process

Abstract

This paper provides means for performance evaluation of a queue with Poisson Pareto burst process (PPBP) input. Because of the long-range dependent nature of the PPBP, straightforward simulations are unreliable. New analytical and simulation techniques are described in this paper. Numerical comparison between the results shows consistency. Conservative dimensioning rules using zero buffer approximations are examined versus the more aggressive analytical approach based on the results of this paper to provide practical guidelines for network design.