The Fourier-series method for inverting transforms of probability distributions
Queueing Systems: Theory and Applications - Numerical computations in queues
The Markov-modulated Poisson process (MMPP) cookbook
Performance Evaluation
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
New models for pseudo self-similar traffic
Performance Evaluation - Special issue on applied probability modelling in telecommunication
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Modeling IP traffic using the batch Markovian arrival process
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Modeling IP traffic: joint characterization of packet arrivals and packet sizes using BMAPs
Computer Networks: The International Journal of Computer and Telecommunications Networking
The oscillating queue with finite buffer
Performance Evaluation
Delay analysis of downlink IP traffic on UMTS mobile networks
Performance Evaluation - Performance 2005
| Hi-index | 0.00 |
In this paper we investigate the blocking probability in a finite-buffer queue whose arrival process is given by the batch Markovian arrival process (BMAP). BMAP generalizes a wide set of Markovian processes and is especially useful as a precise model of aggregated IP traffic. We first give a detailed description of the BMAP, next we prove a formula for the transform of the blocking probability and show how time-dependent and stationary characteristics can be obtained by means of this formula. Then we discuss the computational complexity and other computational issues. Finally, we present a set of numerical results for two different BMAP parameterizations. In particular, we show sample transient and stationary blocking probabilities and the impact of the auto-correlated structure of the arrival process on the blocking probability.