Approximating last-exit probabilities of a random walk, by application to conditional queue length moments within busy periods of M/GI/1 queues
| Autor: | D. J. Daley, L. D. Servi |
|---|---|
| Rok vydání: | 1994 |
| Předmět: | |
| Zdroj: | Journal of Applied Probability. 31:251-267 |
| ISSN: | 1475-6072 0021-9002 |
| DOI: | 10.2307/3214960 |
| Popis: | Certain last-exit and first-passage probabilities for random walks are approximated via a heuristic method suggested by a ladder variable argument. They yield satisfactory approximations of the first- and second-order moments of the queue length within a busy period of an M/D/1 queue. The approximation is applied to the wider class of random walks that arise in studying M/GI/1 queues. For gamma-distributed service times the queue length distribution is independent of the arrival rate. For other distributions where the arrival rate affects the queue length distribution, we have to use conjugate distributions in order to exploit a local central limit property. The limit underlying the approximation has the nature of a Brownian excursion.The source of the problem lies in recent queueing inference work; the connection with Takács' interests comes from both queueing theory and the ballot theorem. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|