Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-28T17:11:36.988Z Has data issue: false hasContentIssue false
  • English
  • Français

Exponential approximation of waiting time and queue size for queues in heavy traffic

Published online by Cambridge University Press:  01 July 2016

Władysław Szczotka
Władysław Szczotka*
Affiliation:
Wrocław University
*
∗Postal address: Mathematical Institute, Wrocław University, Pl. Grunwaldzki 2/4, 50–384 Wrocław, Poland.
Get access Rights & Permissions [Opens in a new window]

Abstract

An exponential approximation for the stationary waiting time distribution and the stationary queue size distribution for single-server queues in heavy traffic is given for a wide class of queues. This class contains for example not only queues for which the generic sequence, i.e. the sequence of service times and interarrival times, is stationary but also such queues for which the generic sequence is asymptotically stationary in some sense. The conditions ensuring the exponential approximation of the characteristics considered in heavy traffic are expressed in terms of the invariance principle for the stationary representation of the generic sequence and its first two moments.

Keywords

STATIONARY WAITING TIME DISTRIBUTIONSTATIONARY QUEUE SIZE DISTRIBUTIONASYMPTOTIC STATIONARITYSTATIONARY REPRESENTATIONWIENER PROCESSCONVERGENCE IN DISTRIBUTION
Type
Research Article
Information
Advances in Applied Probability , Volume 22 , Issue 1 , March 1990 , pp. 230 - 240
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

[1] Balagopal, K. (1979) On queues in discrete regenerative environments, with application to the second of two queues in series. Adv. Appl. Prob. 11, 851–869.CrossRefGoogle Scholar
[2] Billingsley, P. (1968) Convergence of Probability Measures. Wiley, New York.Google Scholar
[3] Borovkov, A. A. (1972) Stochastic Processes in Queueing Theory (in Russian). Nauka, Moscow.Google Scholar
[4] Daley, D. J. and Trengove, C. D. (1977) Bounds for mean waiting times in single server queues: a survey. Statistics Dept. (IAS) Australian National University (Preprint).Google Scholar
[5] Kingman, J. F. C. (1961) The single server queue in heavy traffic. Proc. Camb. Phil. Soc. 57, 902–904.Google Scholar
[6] Kingman, J. F. C. (1965) The heavy traffic approximation in the theory of queues. In Proc. Symp. Congestion Theory, ed. Smith, W. L. and Wilkinson, W. E., University of North Carolina Press, Chapel Hill, 137–169.Google Scholar
[7] Köllerström, J. (1974) Heavy traffic theory for queues with several servers I. J. Appl. Prob. 11, 544–552.Google Scholar
[8] Köllerström, J. (1979) Heavy traffic theory for queues with several servers II. J. Appl. Prob. 16, 393–401.CrossRefGoogle Scholar
[9] Lindvall, T. (1973) Weak convergence of probability measures and random functions in function space D[0, 8). J. Appl. Prob. 10, 109–121.Google Scholar
[10] Loynes, R. M. (1962) The stability of a queue with non-independent inter-arrival and service times. Proc. Camb. Phil. Soc. 58, 497–520.Google Scholar
[11] Szczotka, W. (1986) Stationary representation of queues I. Adv. Appl. Prob. 18, 815–848.CrossRefGoogle Scholar
[12] Szczotka, W. (1986) Stationary representation of queues II. Adv. Appl. Prob. 18, 849–859.Google Scholar
[13] Szczotka, W. (1985) Asymptotic stationarity of multichannel queues. Mathematical Institute, University of Wrocław, Preprint no. 53.Google Scholar
[14] Whitt, W. (1974) Heavy traffic limit theorems for queues: a survey. In Mathematical Methods in Queueing Theory, Proceedings 1973, ed. Clarke, A. B., Lecture Notes in Economics and Mathematical Systems 98, Springer-Verlag, Berlin, 307–350.CrossRefGoogle Scholar