On the transient behavior of the processor sharing queue
- 117 Downloads
We analyze the transient behavior of the single server queue under the processor sharing discipline. Under fairly general assumptions, we give the rate of growth of the number of customers in the queue as well as the asymptotic behavior of the residual service times described in terms of a renormalized point process.
KeywordsPoint processes transience of single server queues ergodic theorems
Unable to display preview. Download preview PDF.
- S. Yashkov, On a heavy traffic limit theorem for theM/G/1 processor sharing queue, Commun. Statist.-Stoch. Models 9 (1993) 467–471.Google Scholar
- J. Neveu,Processus Ponctuels, Lecture Notes in Mathematics, vol. 598 (Springer, Berlin, 1976).Google Scholar
- P. Franken, D. König, U. Arndt and V. Schmidt,Queues and Point Processes (Wiley, Chichester, 1981).Google Scholar
- F. Baccelli and P. Brémaud,Palm Probabilities and Stationary Queues, Lecture Notes in Statistics, vol. 41 (Springer, Berlin, 1987).Google Scholar