The Nonpreemptive Priority Map/G/1 Queue
Operations Research
On Iterative Solutions of General Coupled Matrix Equations
SIAM Journal on Control and Optimization
A matrix-analytic solution for the DBMAP/PH/1 priority queue
Queueing Systems: Theory and Applications
Structured Markov chains solver: software tools
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
A traffic based decomposition of two-class queueing networks with priority service
Computer Networks: The International Journal of Computer and Telecommunications Networking
Two Matrix Iterative Methods for Solving General Coupled Matrix Equations
ICCIS '10 Proceedings of the 2010 International Conference on Computational and Information Sciences
A moments based distribution bounding method
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
The analysis of priority queues where both the arrival and the service processes are correlated does not have a long literature. Only a few results are known, that attack the problem with the matrix geometric machinery. Unfortunately, these results have some restrictions that limit their usability significantly, for example they require the calculation of infinite series of matrices and infinite summations, that can be implemented only by truncation. The method presented in this paper calculates only the queue length moments, but without relying on infinite series of matrices and provides procedures to calculate the arising infinite sums accurately in an efficient way by means of linear equations, matrix-quadratic equations and a coupled matrix-quadratic equation. The numerical examples demonstrate that the presented method is several orders of magnitudes faster than the existing ones. From the large number of queue length moments it is possible to obtain lower and upper bounds for the queue length distribution by using existing moment based distribution estimation results.