Multi-server queueing systems with multiple priority classes (Q812133)

The authors introduce a new analytical recursive dimensionality reduction approach that provides the first near-exact analysis of the M/PH/\(k\) queue with \(m\) preemptive-resume priority classes to obtain the mean and higher moments of response times. This novel approach reduces the \(m\)-dimensional infinite state space, created by the priority classes, to a 1-dimensional infinite state space using ``busy period transitions'' and involves no truncation. It is applicable to a wide range of loads and variability in the job size distribution. This approach considerably reduces the computation time and generalizes several exisiting results [\textit{A. Sleptchenko, A. van Harten} and \textit{M. van der Heijden}, Queueing Syst. 50, 81--107 (2005; Zbl 1080.90036)].