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

Mathematics

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

3 Scopus citations

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

Keywords

Lattice paths
Priority queues
Waiting times

Access to Document

10.1007/s11134-016-9498-6

OpenUrl availability

Full text

Cite this

@article{b04a8dbc2862494fa33ea53fc99510fb,

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 = "Lattice paths, Priority queues, Waiting times",

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

note = "Publisher Copyright: {\textcopyright} 2016, Springer Science+Business Media New York.",

year = "2016",

month = dec,

day = "1",

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

language = "British English",

volume = "84",

pages = "295--307",

journal = "Queueing Systems",

issn = "0257-0130",

publisher = "Springer Netherlands",

number = "3-4",

}

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 - Lattice paths

KW - Priority queues

KW - Waiting times

UR - https://www.scopus.com/pages/publications/84981164354

U2 - 10.1007/s11134-016-9498-6

DO - 10.1007/s11134-016-9498-6

M3 - Article

AN - SCOPUS:84981164354

SN - 0257-0130

VL - 84

SP - 295

EP - 307

JO - Queueing Systems

JF - Queueing Systems

IS - 3-4

ER -

Waiting times in classical priority queues via elementary lattice path counting

Abstract

Keywords

Access to Document

OpenUrl availability

Other files and links

Fingerprint

Cite this