We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Waiting times in classical priority queues via elementary lattice path counting.
- Authors
Vianen, Lars; Gabor, Adriana; Ommeren, Jan-Kees
- 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.
- Subjects
LATTICE paths; QUEUEING networks; QUEUING theory; LAPLACE transformation; DISTRIBUTION (Probability theory)
- Publication
Queueing Systems, 2016, Vol 84, Issue 3/4, p295
- ISSN
0257-0130
- Publication type
Article
- DOI
10.1007/s11134-016-9498-6