Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-27T02:22:52.809Z Has data issue: false hasContentIssue false
  • English
  • Français

Strong approximations for multiple channel queues in heavy traffic

Published online by Cambridge University Press:  14 July 2016

Zhang Hanqin ,
Hsu Guanghui  and
Wang Rongxin
Zhang Hanqin*
Affiliation:
Hebei Institute of Technology
Hsu Guanghui*
Affiliation:
Institute of Applied Mathematics, Academia Sinica
Wang Rongxin*
Affiliation:
Xian Jiaotong University
*
∗Postal address: Teaching and Research Section of Mathematics, Hebei Institute of Technology, Tianjin, The People's Republic of China.
∗∗Postal address: Institute of Applied Mathematics, Academic Sinica, Beijing, The People's Republic of China.
∗∗∗Postal address: Department of Mathematics, Xian Jiaotong University, Xian, Shanxi Province, The People's Republic of China.
Get access Rights & Permissions [Opens in a new window]

Abstract

We prove strong approximations for multiple channel queues in heavy traffic. Strong approximations are given for the waiting time and queue length processes, and for embedded sequences associated with the length process.

Keywords

WIENER PROCESSWAITING TIMEQUEUE LENGTH
Type
Research Papers
Information
Journal of Applied Probability , Volume 27 , Issue 3 , September 1990 , pp. 658 - 670
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.)

References

Chow, Y. S. and Teicher, H. (1978) Probability Theory. Springer-Verlag, New York.Google Scholar
Csörgo, M. and Revesz, P. (1981) Strong Approximations in Probability and Statistics. Academic Press, New York.Google Scholar
Csörgo, M., Deheuvels, P. and Horvath, L. (1987a) An approximation of stopped sums with applications in queueing theory. Adv. Appl. Prob. 19, 674–690.Google Scholar
Csörgo, M., Horváth, L. and Steinebach, J. (1987b) Invariance principles for renewal processes. Ann. Prob. 15, 1441–1460.Google Scholar
Darling, D. and Siegert, A. (1953) The first passage time problem for continuous Markov processes. Ann. Math. Statist. 24, 624–639.CrossRefGoogle Scholar
Iglehart, D. L. and Whitt, W. (1970) Multiple channel queues in heavy traffic. I. Adv. Appl. Prob. 2, 150–177.Google Scholar
Kennedy, D. P. (1972) Rates of convergence for queues in heavy traffic. I. Adv. Appl. Prob. 4, 357–381.Google Scholar
Komlós, J., Major, P. and Tusnády, G. (1975) An approximation of partial sums of independent R.V.'s and the sample D.F.I. Z. Wahrscheinlichkeitsth. 32, 111–131.Google Scholar
Komlós, J., Major, P. and Tusnády, G. (1976) An approximation of partial sums of independent R.V.'s and the sample D.F.II. Z. Wahrscheinlichkeitsth. 34, 33–58.Google Scholar
Major, P. (1976) The approximation of partial sums of independent r.v.'s Z. Wahrscheinlichkeitsth. 35, 213–220.Google Scholar
Prabhu, N. U. (1965) Stochastic Processes. MacMillan, New York.Google Scholar
Smith, W. L. (1958) Renewal theory and its ramifications. J. R. Statist. Soc. B20, 243–302.Google Scholar