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

Jiongze Chen; Ronald G. Addie; Moshe Zukerman; Timothy D. Neame

doi:10.1109/LCOMM.2014.2385083

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

Jiongze Chen^*, Ronald G. Addie, Moshe Zukerman, Timothy D. Neame

^*Corresponding author for this work

Department of Electrical Engineering

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

16 Citations (Scopus)

409 Downloads (CityUHK Scholars)

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.

Original language	English
Pages (from-to)	367-370
Journal	IEEE Communications Letters
Volume	19
Issue number	3
Online published	22 Dec 2014
DOIs	https://doi.org/10.1109/LCOMM.2014.2385083
Publication status	Published - Mar 2015

Research Keywords

Lomax
Long Range Dependence Process
Pareto
Queueing analysis
Traffic modelling

Publisher's Copyright Statement

COPYRIGHT TERMS OF DEPOSITED POSTPRINT FILE: © 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Chen, J., Addie, R. G., Zukerman, M., & Neame, T. D. (2015). Performance Evaluation of a Queue Fed by a Poisson Lomax Burst Process. IEEE Communications Letters, 19(3), 367-370. [6994748]. DOI: 10.1109/LCOMM.2014.2385083

Access Output

10.1109/LCOMM.2014.2385083

Post-print.pdfPost-print, 722 KBLicence: Unspecified

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{7a23e2222b1b4ba3ac8cf133d5ec7eab,

title = "Performance Evaluation of a Queue Fed by a Poisson Lomax Burst Process",

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.",

keywords = "Lomax, Long Range Dependence Process, Pareto, Queueing analysis, Traffic modelling",

author = "Jiongze Chen and Addie, {Ronald G.} and Moshe Zukerman and Neame, {Timothy D.}",

year = "2015",

month = mar,

doi = "10.1109/LCOMM.2014.2385083",

language = "English",

volume = "19",

pages = "367--370",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "IEEE",

number = "3",

}

TY - JOUR

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

AU - Chen, Jiongze

AU - Addie, Ronald G.

AU - Zukerman, Moshe

AU - Neame, Timothy D.

PY - 2015/3

Y1 - 2015/3

N2 - 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.

AB - 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.

KW - Lomax

KW - Long Range Dependence Process

KW - Pareto

KW - Queueing analysis

KW - Traffic modelling

UR - http://www.scopus.com/inward/record.url?scp=84925010806&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84925010806&origin=recordpage

U2 - 10.1109/LCOMM.2014.2385083

DO - 10.1109/LCOMM.2014.2385083

M3 - RGC 21 - Publication in refereed journal

SN - 1089-7798

VL - 19

SP - 367

EP - 370

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 3

ER -

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

Abstract

Research Keywords

Publisher's Copyright Statement

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

CRF: Cost Effective and Survivable Wide-area Topology of Telecommunication Cabling

CRF: Cost Effective and Survivable Wide-area Topology of Telecommunication Cabling

Cite this

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

Abstract

Research Keywords

Publisher's Copyright Statement

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Projects

CRF: Cost Effective and Survivable Wide-area Topology of Telecommunication Cabling

CRF: Cost Effective and Survivable Wide-area Topology of Telecommunication Cabling

Cite this