Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-11-26T04:55:24.099Z Has data issue: false hasContentIssue false
  • English
  • Français

Relations for the workload of the GI/G/s queue

Published online by Cambridge University Press:  01 July 2016

Per Hokstad
Per Hokstad*
Affiliation:
The Norwegian Institute of Technology
*
∗Present address: SINTEF, Division 18, N7034 Trondheim-NTH, Norway.
Get access Rights & Permissions [Opens in a new window]

Abstract

A relation between the distributions of the workload of an arbitrary server and the waiting time is obtained for a GI/G/s queue in steady state. An expression for the total workload of the system (total unprocessed work) is also found. Several well-known results emerge as special cases. Various useful relations, for instance bounds and approximations for the mean waiting time, are also given.

Keywords

WAITING TIMEBOUNDSAPPROXIMATIONS
Type
Research Article
Information
Advances in Applied Probability , Volume 17 , Issue 4 , December 1985 , pp. 887 - 904
Copyright
Copyright © Applied Probability Trust 1985 

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.)

References

Borovkov, A. A. (1976) Stochastic Processes in Queueing Theory (Translated from Russian edition, 1972.) Springer-Verlag, New York.Google Scholar
Brumelle, S. L. (1971a) Some inequalities for parallel-server queues. Operat. Res. 19, 402–413.Google Scholar
Brumelle, S. L. (1971b) On the relation between customer and time averages in queues. J. Appl. Prob. 8, 508–520.Google Scholar
Chung, K. L. (1974) A Course in Probability Theory , 2nd edn. Academic Press. New York.Google Scholar
De Smit, J. H. A. (1973) Some general results for many server queues. Adv. Appl. Prob. 5, 153–169.Google Scholar
Hokstad, P. (1980) The steady-state solution of the M/K2/m queue. Adv. Appl. Prob. 12, 799–823.Google Scholar
Kiefer, J. and Wolfowitz, J. (1955) On the theory of queues with many servers. Trans. Amer. Math. Soc. 78, 1–18.Google Scholar
Kingman, J. F. C. (1964). The heavy traffic approximation in the theory of queues. In Proc. Symp. Congestion Theory , ed. Smith, W. L. and Wilkinson, R. I. University of North Carolina Press, Chapel Hill, 137–169.Google Scholar
Kingman, J. F. C. (1970) Inequalities in the theory of queues. J. R. Statist. Soc. B 32, 102–110.Google Scholar
Köllerström, J. (1974) Heavy traffic theory for queues with several servers. I. J. Appl. Prob. 11, 544–552.Google Scholar
Kopicinski, B. and Rolski, T. (1977) A note on the virtual waiting time in the GI/G/s queue. Bull. Acad. Polon. Sci., Ser. Sci. Math. Astronom. Phys. 25, 1279–1280.Google Scholar
Mori, ?. (1975) Some bounds for queues. J. Operat. Res. Soc. Japan 18, 152–181.Google Scholar
Takács, L. (1963) The limiting distribution of the virtual waiting time and the queue size for a single-server queue with recurrent input and general service times. Sankhya A 25, 91–100.Google Scholar
Tums, H. C., Van Hoorn, M. H. and Federgruen, A. (1981) Approximations for the steady-state probabilities in the M/G/c queue. Adv. Appl. Prob. 13, 186–206.Google Scholar
Whitt, W. (1982) Existence of limiting distributions in the GI/G/s queue. Math. Operat. Res. 7, 88–94.Google Scholar