2016-12-01
Waiting times in classical priority queues via elementary lattice path counting
Publication
Publication
Queueing Systems p. 1- 13
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.
| Additional Metadata | |
|---|---|
| , , | |
| doi.org/10.1007/s11134-016-9498-6, hdl.handle.net/1765/96657 | |
| Queueing Systems | |
| Organisation | Department of Econometrics |
|
van Vianen, L.A. (Lars A.), Gabor, A. F., & van Ommeren, J.-K. (2016). Waiting times in classical priority queues via elementary lattice path counting. Queueing Systems, 1–13. doi:10.1007/s11134-016-9498-6 |
|