Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-30T20:27:08.414Z Has data issue: false hasContentIssue false
  • English
  • Français

Bounds on the expected waiting time in a GI/G/1 queue: upgrading for low traffic intensity

Published online by Cambridge University Press:  14 July 2016

Zvi Rosberg
Zvi Rosberg*
Affiliation:
IBM T. J. Watson Research Center
*
∗Postal address: IBM T. J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

For a GI/G/1 queue we derive new lower and uper bounds on the expected stationary waiting time which are a function of more than the first two moments of the inter-arrival and service times. When the probability for a delay is low, the bounds tend to be better than other bounds. This is illustrated in an example of a Uniform/Uniform/1 queue.

Keywords

STATIONARY WAITING TIMEUNIFORM/UNIFORM/1 QUEUE
Type
Research Papers
Information
Journal of Applied Probability , Volume 24 , Issue 3 , September 1987 , pp. 749 - 757
Copyright
Copyright © Applied Probability Trust 1987 

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

Footnotes

The author is on leave from the Technion–IIT, Computer Science Department, Haifa 32000, Israel.

References

[1] Barlow, R. E. and Proschan, F. (1975) Statistical Theory of Reliability and Life Testing, Probability Models. Holt, Rinehart and Winston, Inc., New York.Google Scholar
[2] Daley, D. J. (1977) Inequalities for moments of tails of random variables with a queueing application. Z. Wahrscheinlichkeitsth. 41, 139–143.Google Scholar
[3] Fainberg, M. A. and Stoyan, D. (1978) A further remark on a paper of K. T. Marshall on bounds for GI/G/1. Math. Operat. Stat. Ser. Optim. 9, 145–150.Google Scholar
[4] Kingman, J. F. C. (1970) Inequalities in the theory of queues. J. R. Statist. Soc. B 32, 102–110.Google Scholar
[5] Loulou, R. (1978) An explicit upper bound for the mean busy period in a GI/G/1 queue. J. Appl. Prob. 15, 452–455.CrossRefGoogle Scholar
[6] Marshall, K. T. (1968) Some inequalities in queueing. Operat. Res. 16, 651–665.Google Scholar
[7] Rogozin, B. A. (1966) Some extremal problems in the theory of mass service. Theory Prob. Appl. 11, 144–151.Google Scholar
[8] Siegel, G. (1974) Abschätzungen fur die Wartezeitverteilungen und ihrer Momente beim Wartemodell GI/G/1 mit und ohne “Erwärmung”. Z. Angew. Math. Mech. 54, 609–619.CrossRefGoogle Scholar
[9] Stoyan, D. (1983) Comparison Methods for Queues and Other Stochastic Models. Wiley, New York.Google Scholar
[10] Whitt, W. (1982) The Marshall and Stoyan bounds for IMRL/G/1 queues are tight. Operat. Res. Lett. 1, 209–213.Google Scholar