Hostname: page-component-848d4c4894-xfwgj Total loading time: 0 Render date: 2024-06-20T16:17:21.541Z Has data issue: false hasContentIssue false
  • English
  • Français

Tightness of the stationary waiting time in heavy traffic

Part of: Special processes Limit theorems

Published online by Cambridge University Press:  01 July 2016

Władysław Szczotka
Władysław Szczotka*
Affiliation:
University of Wrocław
*
∗ Postal address: Mathematical Institute, University of Wrocław, Pl. Grunwaldzki 2/4, 50-384 Wrocław, Poland. Email address: szczotka@math.uni.wroc.pl
Get access Rights & Permissions [Opens in a new window]

Abstract

Sufficient conditions are given ensuring tightness of a suitably normalized stationary waiting time in the FIFO G/G/1 queue under heavy traffic.

Keywords

Single server queueing systemstationary waiting timeheavy traffictightnessmixing conditions

MSC classification

Primary: 60K25: Queueing theory
Secondary: 60F17: Functional limit theorems; invariance principles
Type
General Applied Probability
Information
Advances in Applied Probability , Volume 31 , Issue 3 , September 1999 , pp. 788 - 794
Copyright
Copyright © Applied Probability Trust 1999 

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

Partially supported by KBN grant Nr 2 PO3A 056 09.

References

Billingsley, P. (1968). Convergence of Probability Measures. Wiley, New York.Google Scholar
Chow, Y. S. and Teicher, H. (1978). Probability Theory. Springer, New York.CrossRefGoogle Scholar
Daley, D. J., Foley, R. D. and Rolski, T. (1994). Conditions for finite moments of waiting times in G/G/1 queues. Queueing Systems 17, 89–106.Google Scholar
Ibragimov, I. A. and Linnik, Yu. V. (1971). Independent and Stationary Sequences of Random Variables. Wolters-Noordhoff, Groningen.Google Scholar
Ibragimov, I. A. (1975). A note on the central limit theorem for dependent random variables. Theory Prob. Appl. 20, 134–140.CrossRefGoogle Scholar
Kingman, J. F. (1964). A martingale inequality in the theory of queues. Proc. Camb. Phil. Soc., 359–361.Google Scholar
Oodaria, H. and Yshihara, K. (1972). Functional central limit theorems for strictly stationary processes satisfying the strong mixing condition. Kodai Math. Sem. Rep. 24, 259–269.Google Scholar
Peligrad, M. (1986). Recent advances in the central limit theorem and its weak invariance principle for mixing sequences of random variables (a survey). In Dependence in Probability and Statistics. Birkhauser, Basel, pp. 193–223.Google Scholar
Ross, S. R. (1996). Stochastic Processes. Wiley, New York.Google Scholar
Serfling, R. J. (1970). Moment inequalities for the maximum cumulative sum. Ann. Math. Statist. 4, 1227–1234.Google Scholar
Szczotka, W. (1990). Exponential approximation of waiting time and queue size for queues in heavy traffic. Adv. Appl. Prob. 22, 230–240.Google Scholar
Szczotka, W. (1992). A distributional form of Little law in heavy traffic. Ann. Prob. 25, 790–800.Google Scholar
Yokoyama, R. (1980). Moment bounds for stationary mixing sequences. Z. Wahrscheinlichkeitsth. 52, 45–57.CrossRefGoogle Scholar