Introduction to queueing theory (2nd ed)
Introduction to queueing theory (2nd ed)
Performance Evaluation - Special issue on performance modeling of high speed telecommunication systems
The Markov-modulated Poisson process (MMPP) cookbook
Performance Evaluation
An EM algorithm for estimation in Markov-modulated Poisson processes
Computational Statistics & Data Analysis
Transient behaviour of queueing systems with correlated traffic
Performance Evaluation
Exact Buffer Overflow Calculations for Queues via Martingales
Queueing Systems: Theory and Applications
Modeling IP traffic using the batch Markovian arrival process
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
The oscillating queue with finite buffer
Performance Evaluation
QBDs with Marked Time Epochs: a Framework for Transient Performance Measures
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Solving finite-buffer queues with Markovian arrivals
ACM SIGMETRICS Performance Evaluation Review
Hi-index | 0.00 |
In this report we deal with the time to buffer overflow in a finite-buffer queue with MMPP (Markov-modulated Poisson process) arrivals. The results include a closed-form formula for the transform of the distribution of the time to buffer overflow. The main benefit of this formula is that, using properties of the transform, we can easily compute the average overflow time and all the moments (variance etc). Moreover, by means of an inversion algorithm, we can obtain the probability density function and cumulative distribution function of the overflow time. Analytical results are illustrated by a numerical example based on MMPP parameterization fitted to an IP traffic trace file.