Waiting times in classical priority queues via elementary lattice path counting

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

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)
4 Downloads (Pure)


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
Pages (from-to)295-307
Number of pages13
JournalQueueing systems
Issue number3
Publication statusPublished - 1 Dec 2016


  • MSC-68M20
  • MSC-60K25
  • MSC-90B22
  • lattice-paths
  • METIS-321691
  • non-preemptive priority
  • Multi-server queue
  • IR-103346
  • EWI-27662

Cite this