Waiting times in classical priority queues via elementary lattice path counting

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

doi:10.1007/s11134-016-9498-6

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

Stochastic Operations Research

Research output: Contribution to journal › Article › Academic › peer-review

3 Citations (Scopus)

30 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 language	English
Pages (from-to)	295-307
Number of pages	13
Journal	Queueing systems
Volume	84
Issue number	3
DOIs	https://doi.org/10.1007/s11134-016-9498-6
Publication status	Published - 1 Dec 2016

Keywords

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

Access to Document

10.1007/s11134-016-9498-6

ArticleFinal published version, 461 KBLicence: Taverne

Cite this

@article{92f23ae636c8439299ce20f694dd43e0,

title = "Waiting times in classical priority queues via elementary lattice path counting",

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.",

keywords = "MSC-68M20, MSC-60K25, MSC-90B22, Lattice-paths, Non-preemptive priority, Multi-server queue, 2023 OA procedure",

author = "\{van Vianen\}, \{Lars A.\} and Gabor, \{Adriana F.\} and \{van Ommeren\}, Jan-Kees",

year = "2016",

month = dec,

day = "1",

doi = "10.1007/s11134-016-9498-6",

language = "English",

volume = "84",

pages = "295--307",

journal = "Queueing systems",

issn = "0257-0130",

publisher = "Springer",

number = "3",

}

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-Kees

PY - 2016/12/1

Y1 - 2016/12/1

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

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

KW - MSC-68M20

KW - MSC-60K25

KW - MSC-90B22

KW - Lattice-paths

KW - Non-preemptive priority

KW - Multi-server queue

KW - 2023 OA procedure

U2 - 10.1007/s11134-016-9498-6

DO - 10.1007/s11134-016-9498-6

M3 - Article

SN - 0257-0130

VL - 84

SP - 295

EP - 307

JO - Queueing systems

JF - Queueing systems

IS - 3

ER -

Waiting times in classical priority queues via elementary lattice path counting

Abstract

Keywords

Access to Document

Fingerprint

Cite this