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.

, ,
hdl.handle.net/1765/77258
ERIM Report Series Research in Management
ERIM report series research in management Erasmus Research Institute of Management
Erasmus Research Institute of Management

van Vianen, L., Gabor, A., & van Ommeren, J.-K. (2014). A simple derivation of the waiting time distributions in a non-preemptive M/M/c queue with priorities (No. ERS-2014-016-LIS). ERIM report series research in management Erasmus Research Institute of Management. Retrieved from http://hdl.handle.net/1765/77258