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

2 Citations (Scopus)
3 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
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
  • METIS-321691
  • non-preemptive priority
  • Multi-server queue
  • IR-103346
  • EWI-27662

Cite this

van Vianen, Lars A. ; Gabor, Adriana F. ; van Ommeren, Jan C.W. / Waiting times in classical priority queues via elementary lattice path counting. In: Queueing systems. 2016 ; Vol. 84, No. 3. pp. 295-307.
@article{92f23ae636c8439299ce20f694dd43e0,
title = "Waiting times in classical priority queues via elementary lattice path counting",
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 = "MSC-68M20, MSC-60K25, MSC-90B22, lattice-paths, METIS-321691, non-preemptive priority, Multi-server queue, IR-103346, EWI-27662",
author = "{van Vianen}, {Lars A.} and Gabor, {Adriana F.} and {van Ommeren}, {Jan C.W.}",
note = "10.1007/s11134-016-9498-6",
year = "2016",
month = "12",
day = "1",
doi = "10.1007/s11134-016-9498-6",
language = "Undefined",
volume = "84",
pages = "295--307",
journal = "Queueing systems",
issn = "0257-0130",
publisher = "Springer",
number = "3",

}

Waiting times in classical priority queues via elementary lattice path counting. / van Vianen, Lars A.; Gabor, Adriana F.; van Ommeren, Jan C.W.

In: Queueing systems, Vol. 84, No. 3, 01.12.2016, p. 295-307.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Waiting times in classical priority queues via elementary lattice path counting

AU - van Vianen, Lars A.

AU - Gabor, Adriana F.

AU - van Ommeren, Jan C.W.

N1 - 10.1007/s11134-016-9498-6

PY - 2016/12/1

Y1 - 2016/12/1

N2 - 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.

AB - 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.

KW - MSC-68M20

KW - MSC-60K25

KW - MSC-90B22

KW - lattice-paths

KW - METIS-321691

KW - non-preemptive priority

KW - Multi-server queue

KW - IR-103346

KW - EWI-27662

U2 - 10.1007/s11134-016-9498-6

DO - 10.1007/s11134-016-9498-6

M3 - Article

VL - 84

SP - 295

EP - 307

JO - Queueing systems

JF - Queueing systems

SN - 0257-0130

IS - 3

ER -