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. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1007/s11134-016-9498-6 | Queueing Syst. |
Keywords | Field | DocType |
Priority queues,Waiting times,Lattice paths,90B22,60K25,68M20 | Lattice (order),Inversion (meteorology),Computer science,Lattice path,Queue,Real-time computing,Priority queue,Queue management system | Journal |
Volume | Issue | ISSN |
84 | 3-4 | 0257-0130 |
Citations | PageRank | References |
1 | 0.39 | 3 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Lars A. van Vianen | 1 | 2 | 0.75 |
Adriana Gabor | 2 | 13 | 1.81 |
j c w van ommeren | 3 | 14 | 1.74 |