A Simple Derivation of the Waiting Time Distributions in a Non-Preemptive M/M/C Queue with Priorities

12 Pages Posted: 8 Jan 2015

See all articles by Lars van Vianen

Lars van Vianen

Erasmus University Rotterdam (EUR) - Erasmus School of Economics (ESE)

Adriana F. Gabor

Erasmus University Rotterdam (EUR)

Jan-Kees van Ommeren

University of Twente

Date Written: January 8, 2015

Abstract

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.

Keywords: multi-server queue, non-preemptive priority, lattice-paths

Suggested Citation

van Vianen, Lars and Gabor, Adriana F. and van Ommeren, Jan-Kees, A Simple Derivation of the Waiting Time Distributions in a Non-Preemptive M/M/C Queue with Priorities (January 8, 2015). ERIM Report Series Reference No. ERS-2014-016-LIS, Available at SSRN: https://ssrn.com/abstract=2546922 or http://dx.doi.org/10.2139/ssrn.2546922

Lars Van Vianen (Contact Author)

Erasmus University Rotterdam (EUR) - Erasmus School of Economics (ESE) ( email )

P.O. Box 1738
3000 DR Rotterdam, NL 3062 PA
Netherlands

Adriana F. Gabor

Erasmus University Rotterdam (EUR) ( email )

Burgemeester Oudlaan 50
3000 DR Rotterdam, Zuid-Holland 3062PA
Netherlands

Jan-Kees Van Ommeren

University of Twente

Postbus 217
Twente
Netherlands

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
132
Abstract Views
738
Rank
406,577
PlumX Metrics