Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO
- 1 June 1986
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 23 (2) , 550-554
- https://doi.org/10.2307/3214199
Abstract
We provide a term-by-term interpretation of Beneš's well-known but mysterious inversion of the Pollaczek–Khintchine formula. The strategy is to recognize the equality of waiting time in M/G/1–FIFO with remaining work in M/G/1–LIFO–preemptive resume. In the process, we give a new and simple derivation of some known results for M/G/1–LIFO–preemptive resume.Keywords
This publication has 7 references indexed in Scilit:
- The sojourn-time distribution in the M/G/1 queue by processor sharingJournal of Applied Probability, 1984
- Poisson Arrivals See Time AveragesOperations Research, 1982
- Insensitivity in queueing systemsAdvances in Applied Probability, 1981
- Stochastic Storage ProcessesPublished by Springer Nature ,1980
- Insensitivity of steady-state distributions of generalized semi-Markov processes by speedsAdvances in Applied Probability, 1978
- The departure process from a queueing systemMathematical Proceedings of the Cambridge Philosophical Society, 1976
- On Queues with Poisson ArrivalsThe Annals of Mathematical Statistics, 1957