Abstract
We consider the M/G/1 queue under the foreground-background processor-sharing discipline. Using a result on the stationary distribution of the total number of customers we give a direct derivation of the distribution of the random counting measure representing the steady state of the queue in all detail.
This is a preview of subscription content, log in via an institution to check access.
References
J.L. Doob,Stochastic Processes (J. Wiley, New York, 1953).
L. Kleinrock,Queueing Systems (J. Wiley, New York, 1976).
J. Neveu,Processus Ponctuels, Vol. 598 of Lecture notes in maths (Springer Verlag, Berlin, 1976).
A.V. Pechinkin, Stationary probabilities in a system with discipline of advantageous distribution of a process, Eng. Cybern. 5 (1981) 73–77.
R. Schassberger, A detailed steady state analysis of the M/G/1 queue under various time sharing disciplines, In:Computer Performance and Reliability, O.J. Boxma, G. Iazeolla and P.J. Courtois (North-Holland, 1987) 431–442.
R. Schassberger, The steady state distribution of spent service times present in the M/G/1 foreground-background processor-sharing queue. Journal of Applied Proba. 25 (7) (1988) 194–203.
L.E. Schrage, The M/G/1 queue with feedback to lower priority queues, Man. Sci. 13 (1967) 466–471.
S.F. Yashkov, Analysis of a system with priority-based processor sharing, Eng. Cybern. 18 (1984) 29–38.
S.F. Yashkov, Processor sharing queues: some progress in analysis, Questa 2 (1987) 11–18.
Author information
Authors and Affiliations
Additional information
This work was done during a sabbatical at INRIA, France.
Rights and permissions
About this article
Cite this article
Robert, P., Schassberger, R. On the M/G/1 foreground-background processor-sharing queue. Queueing Syst 4, 281–286 (1989). https://doi.org/10.1007/BF02100271
Received:
Revised:
Issue date:
DOI: https://doi.org/10.1007/BF02100271