Performance Evaluation of a Queue Fed by a Poisson Lomax Burst Process

We consider a special case of the M/G/∞ traffic process, named as Poisson Lomax Burst Process (PLBP), where the burst lengths follow the Lomax distribution. We illustrate its advantage in modelling Internet traffic flow sizes, particularly, its ability to capture a large number of small flows. We provide two approximations based on analytical and fast simulation methods for the overflow probability of a single server queue fed by PLBP, and illustrate their accuracy by discrete-event simulations.