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 analysed, the proposed method offers new insights and complements the results previously obtained by inverting the associated Laplace Transforms.
['Lars van Vianen', 'Adriana Felicia Gabor', 'Jan-Kees van Ommeren']
Waiting times in classical priority queues via elementary lattice path counting