Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-12T16:54:34.304Z Has data issue: false hasContentIssue false
  • English
  • Français

The M/G/1 processor sharing queue as the almost sure limit of feedback queues

Published online by Cambridge University Press:  14 July 2016

J. A. C. Resing,
G. Hooghiemstra and
M. S. Keane
J. A. C. Resing*
Affiliation:
Delft University of Technology
G. Hooghiemstra*
Affiliation:
Delft University of Technology
M. S. Keane*
Affiliation:
Delft University of Technology
*
∗ Postal address for all authors: Faculty of Technical Mathematics and Informatics, Delft University of Technology, P.O. Box 356, 2600 AJ Delft, The Netherlands.
∗ Postal address for all authors: Faculty of Technical Mathematics and Informatics, Delft University of Technology, P.O. Box 356, 2600 AJ Delft, The Netherlands.
∗ Postal address for all authors: Faculty of Technical Mathematics and Informatics, Delft University of Technology, P.O. Box 356, 2600 AJ Delft, The Netherlands.
Get accessRights & Permissions [Opens in a new window]

Abstract

In the paper a probabilistic coupling between the M/G/1 processor sharing queue and the M/M/1 feedback queue, with general feedback probabilities, is established. This coupling is then used to prove the almost sure convergence of sojourn times in the feedback model to sojourn times in the M/G/1 processor sharing queue. Using the theory of regenerative processes it follows that for stable queues the stationary distribution of the sojourn time in the feedback model converges in law to the corresponding distribution in the processor sharing model. The results do not depend on Poisson arrival times, but are also valid for general arrival processes.

Keywords

SOJOURN TIMESCOUPLING METHODS

Information

Type
Short Communication
Information
Journal of Applied Probability , Volume 27 , Issue 4 , December 1990, pp. 913 - 918
Copyright
Copyright © Applied Probability Trust 1990 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1] Van Den Berg, J. L. and Boxma, O. J. (1989) Sojourn times in feedback and processor sharing queues. Teletraffic Science for new Cost-Effective Systems, Networks and Services, ITC 12, ed. Bonatti, M., North-Holland, Amsterdam.Google Scholar
[2] Billingsley, P. (1968) Convergence of Probability Measures. Wiley, New York.Google Scholar
[3] Gut, A. (1988) Stopped Random Walks. Springer-Verlag, Berlin.CrossRefGoogle Scholar
[4] Ott, T. J. (1984) The sojourn time distribution in the M/G/1 queue with processor sharing. J. Appl. Prob. 21, 360–378.Google Scholar
[5] Pollard, D. (1984) Convergence of Stochastic Processes. Springer-Verlag, New York.Google Scholar
[6] Schassberger, R. (1984) A new approach to the M/G/1 processor sharing queue. Adv. Appl. Prob. 16, 202–213.CrossRefGoogle Scholar
[7] Yashkov, S. F. (1983) A derivation of response time distribution for an M/G/1 processor sharing queue. Problems Control Inform. Theory 12, 133–148.Google Scholar