Download This PaperA Simple Derivation of the Waiting Time Distributions in a Non-Preemptive M/M/C Queue with Priorities
12 Pages Posted: 8 Jan 2015
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: 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
Do you have negative results from your research you’d like to share?
Feedback
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.