Queueing Systems: Theory and Applications
Departure Processes of BMAP/G/1 Queues
Queueing Systems: Theory and Applications
Departure Process of the MAP/SM/1 Queue
Queueing Systems: Theory and Applications
On the Doubling Algorithm for a (Shifted) Nonsymmetric Algebraic Riccati Equation
SIAM Journal on Matrix Analysis and Applications
A traffic based decomposition of two-class queueing networks with priority service
Computer Networks: The International Journal of Computer and Telecommunications Networking
Comparison of Two Output Models for the BMAP/MAP/1 Departure Process
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
A joint moments based analysis of networks of MAP/MAP/1 queues
Performance Evaluation
Multi-class Markovian arrival processes and their parameter fitting
Performance Evaluation
Alternating-directional Doubling Algorithm for $M$-Matrix Algebraic Riccati Equations
SIAM Journal on Matrix Analysis and Applications
| Hi-index | 0.00 |
The analysis of the departure process of queues is important in several aspects, for instance, it plays a prominent role in the decomposition based analysis of open queueing networks. While there are several results available for the departure process analysis of MAP driven single-class (or, single-type) queues, there are very few results available for the multi-type variants of these queues. In this paper we consider the departure process of the multi-type MMAP[K]/PH[K]/1 FCFS queue. We derive the joint Laplace-Stieltjes transform of the lag-n inter-departure times, and provide efficient algorithms to compute the lag-1 joint moments, the lag-n joint means and cross correlations of the inter-departure times. While the analysis of the departure process is typically performed via the queue length distribution at departure instants, we rely on the age process to derive various properties of the departure process.