Efficient analysis of the MMAP[K]/PH[K]/1 priority queue
Provides a unique approach to the analysis of the MMAP[K]/PH[K]/1 priority queue. Both the preemptive resume and the non-preemptive service policies are covered. Properties of the sojourn time and the number of jobs in the system are obtained. Numerically efficient procedure that can handle a large number of phases. At least an order of magnitude faster than alternative methods.
queueing preemptive resume priority queue non-preemptive priority queue matrix-analytic methods