In this article we give a new derivation for the waiting time distributions in an M=M=c queue with multiple priorities and a common service rate by using elementary lattice paths counting. An advantage of the approach is that it does not require inversion of the Laplace-Stieltjes transform.
|Name||Memorandum / Department of Applied Mathematics|
|Publisher||University of Twente, Department of Applied Mathematics|
- Multi-server queue
- non-preemptive priority