Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Yashkov, On a heavy traffic limit theorem for theM/G/1 processor sharing queue, Commun. Statist.-Stoch. Models 9 (1993) 467–471.
J. Neveu,Processus Ponctuels, Lecture Notes in Mathematics, vol. 598 (Springer, Berlin, 1976).
P. Franken, D. König, U. Arndt and V. Schmidt,Queues and Point Processes (Wiley, Chichester, 1981).
F. Baccelli and P. Brémaud,Palm Probabilities and Stationary Queues, Lecture Notes in Statistics, vol. 41 (Springer, Berlin, 1987).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jean-Marie, A., Robert, P. On the transient behavior of the processor sharing queue. Queueing Syst 17, 129–136 (1994). https://doi.org/10.1007/BF01158692
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01158692