GI/G/1 processor sharing queue in heavy traffic
- 1 June 1994
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 26 (2) , 539-555
- https://doi.org/10.2307/1427450
Abstract
ConsiderGI/G/1 processor sharing queues with traffic intensity tending to 1. Using the theory of random measures and the theory of branching processes we investigate the limiting behaviour of the queue length, sojourn time and random measures describing attained and residual processing times of customers present.Keywords
This publication has 9 references indexed in Scilit:
- On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processesAdvances in Applied Probability, 1992
- An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queueCommunications in Statistics. Stochastic Models, 1992
- Crump–Mode–Jagers Branching Processes As a Method of Investigating ${\rm M}/{\rm G}/1$ Systems with Processor SharingTheory of Probability and Its Applications, 1992
- The gi/m/1 processor-sharing queue and its heavy traffic analysisCommunications in Statistics. Stochastic Models, 1991
- Processor-sharing queues: Some progress in analysisQueueing Systems, 1987
- The growth and composition of branching populationsAdvances in Applied Probability, 1984
- Random MeasuresPublished by Walter de Gruyter GmbH ,1983
- Limit Theorems for Stochastic ProcessesTheory of Probability and Its Applications, 1956
- Convergence of Random Processes and Limit Theorems in Probability TheoryTheory of Probability and Its Applications, 1956