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.

Additional Metadata
Keywords Priority queues, Waiting times, Lattice paths
Persistent URL hdl.handle.net/1765/80103
Series Econometric Institute Research Papers
Citation
van Vianen, L.A, Gabor, A.F, & van Ommeren, J.C.W. (2016). Waiting times in classical priority queues via elementary lattice path counting (No. EI2016-17). Econometric Institute Research Papers. Retrieved from http://hdl.handle.net/1765/80103