A simple derivation of the waiting time distributions in a non-preemptive M/M/c queue with priorities

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.

MoreLess

Year of publication:	2014-12-11
Authors:	van Vianen, van Vianen, L.A. ; Gabor, Gabor, A.F. ; van Ommeren, van Ommeren, J.C.W.
Institutions:	Erasmus Research Institute of Management (ERIM), Erasmus Universiteit Rotterdam
Subject:	multi-server queue \| non-preemptive priority \| lattice-paths

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	ERIM Report Series Research in Management. - ISSN 1566-5283.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series RePEc:ems:eureri Number ERS-2014-016-LIS 1 pages long
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011099769