Waiting times in classical priority queues via elementary lattice path counting

Lars A. van Vianen, Adriana F. Gabor*, Jan-Kees van Ommeren

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)
21 Downloads (Pure)

Abstract

In this paper, we describe an elementary combinatorial approach for deriving the waiting and response time distributions in a few classical priority queueing models. By making use of lattice paths that are linked in a natural way to the stochastic processes analyzed, the proposed method offers new insights and complements the results previously obtained by inverting the associated Laplace transforms.
Original languageEnglish
Pages (from-to)295-307
Number of pages13
JournalQueueing systems
Volume84
Issue number3
DOIs
Publication statusPublished - 1 Dec 2016

Keywords

  • MSC-68M20
  • MSC-60K25
  • MSC-90B22
  • Lattice-paths
  • Non-preemptive priority
  • Multi-server queue
  • 2023 OA procedure

Fingerprint

Dive into the research topics of 'Waiting times in classical priority queues via elementary lattice path counting'. Together they form a unique fingerprint.

Cite this