On the Queue Length Distribution in BMAP Systems

Published online: Apr 4, 2017 Full Text: PDF (470 KiB) DOI: 10.24138/jcomss.v2i4.272
Cite this paper
Andrzej Chydzinski


Batch Markovian Arrival Process – BMAP – is a teletraffic model which combines high ability to imitate complex statistical behaviour of network traces with relative simplicity in analysis and simulation. It is also a generalization of a wide class of Markovian processes, a class which in particular include the Poisson process, the compound Poisson process, the Markovmodulated Poisson process, the phase-type renewal process and others. In this paper we study the main queueing performance characteristic of a finite-buffer queue fed by the BMAP, namely the queue length distribution. In particular, we show a formula for the Laplace transform of the queue length distribution. The main benefit of this formula is that it may be used to obtain both transient and stationary characteristics. To demonstrate this, several numerical results are presented.


teletraffic modeling, finite-buffer queue, BMAP, performance evaluation
Creative Commons License 4.0
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.