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

Lars A. van Vianen, Adriana F. Gabor, Jan C.W. van Ommeren

Research output: Book/ReportReportProfessional

140 Downloads (Pure)

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.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages13
Publication statusPublished - 31 Dec 2014

Publication series

NameMemorandum / Department of Applied Mathematics
PublisherUniversity of Twente, Department of Applied Mathematics
No.2039
ISSN (Print)1874-4850

Keywords

  • IR-93876
  • METIS-309802
  • Multi-server queue
  • EWI-25541
  • lattice-paths
  • non-preemptive priority

Cite this