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

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

6 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Article number6994748
Pages (from-to)367-370
Journal / PublicationIEEE Communications Letters
Volume19
Issue number3
Online published22 Dec 2014
Publication statusPublished - Mar 2015

Link(s)

Abstract

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.

Research Area(s)

  • Lomax, Long Range Dependence Process, Pareto, Queueing analysis, Traffic modelling

Citation Format(s)

Performance Evaluation of a Queue Fed by a Poisson Lomax Burst Process. / Chen, Jiongze; Addie, Ronald G.; Zukerman, Moshe; Neame, Timothy D.

In: IEEE Communications Letters, Vol. 19, No. 3, 6994748, 03.2015, p. 367-370.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

Download Statistics

No data available