Waiting time distribution in a two-class two-server heterogeneous priority queue
Our aim is to analyze a Markovian two-class two-server queue with non-preemptive heterogeneous priority structures. We use matrix-geometric methods and derive the stationary distribution of queue lengths. To obtain the distribution of waiting times, we develop a dedicated algorithm by extending the approach of Ramaswami and Lucantoni.
waiting times heterogeneous priority queue markovian matrix-geometric