On a heavy traffic limit theorem for the M/G/1 processor-sharing queue
- 1 January 1993
- journal article
- research article
- Published by Taylor & Francis in Communications in Statistics. Stochastic Models
- Vol. 9 (3) , 467-471
- https://doi.org/10.1080/15326349308807276
Abstract
We give an elementary proof of the heavy traffic limit theorem for the conditional sojourn time distribution in the M/G/1 queue with processor-sharing. This theorem was announced in [7] without proofKeywords
This publication has 3 references indexed in Scilit:
- Mathematical problems in the theory of shared-processor systemsJournal of Mathematical Sciences, 1992
- The sojourn-time distribution in the M/G/1 queue by processor sharingJournal of Applied Probability, 1984
- A new approach to the M/G/1 processor-sharing queueAdvances in Applied Probability, 1984