Hostname: page-component-77c89778f8-fv566 Total loading time: 0 Render date: 2024-07-18T23:30:22.955Z Has data issue: false hasContentIssue false
  • English
  • Français

Functional limit theorems for the queue GI/G/1 in light traffic

Published online by Cambridge University Press:  01 July 2016

Donald L. Iglehart
Donald L. Iglehart*
Affiliation:
Stanford University
Get access Rights & Permissions [Opens in a new window]

Extract

We consider a single GI/G/1 queueing system in which customer number 0 arrives at time t0 = 0, finds a free server, and experiences a service time v0. The nth customer arrives at time tn and experiences a service time vn. Let the interarrival times tn - tn-1 = un, n ≧ 1, and define the random vectors Xn = (vn-1, un), n ≧ 1. We assume the sequence of random vectors {Xn : n ≧ 1} is independent and identically distributed (i.i.d.). Let E{un} = λ-1 and E{vn} = μ-1, where 0 < λ, μ < ∞. In addition, we shall always assume that E{v02} < ∞ and that the deterministic system in which both vn and un are degenerate is excluded. The natural measure of congestion for this system is the traffic intensity ρ = λ/μ. In this paper we shall restrict our attention to systems in which ρ < 1. Under this condition, which we shall refer to as light traffic, our system is of course stable.

Type
Research Article
Information
Advances in Applied Probability , Volume 3 , Issue 2 , Autumn 1971 , pp. 269 - 281
Copyright
Copyright © Applied Probability Trust 1971 

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] Billingsley, P. (1968) Convergence of Probability Measures. John Wiley, New York.Google Scholar
[2] Chung, K. (1960) Markov Chains with Stationary Transition Probabilities. Springer-Verlag, Berlin.Google Scholar
[3] Chung, K. (1968) A Course in Probability Theory. Harcourt, Brace and World, New York.Google Scholar
[3a] Doeblin, W. (1938) Sur deux problèmes de M. Kolmogorov concernant les chaines dénombrables. Bull. Soc. Math. France. 66, 210–220.CrossRefGoogle Scholar
[3b] Doob, J. (1953) Stochastic Processes. John Wiley, New York.Google Scholar
[4] Freedman, D. (1967) Some invariance principles for functionals of a Markov chain. Ann. Math. Statist. 38, 1–7.CrossRefGoogle Scholar
[5] Iglehart, D. (1971) Multiple channel queues in heavy traffic. IV: law of the iterated logarithm. Z. Wahrscheinlichkeitsth. 17, 168–180.Google Scholar
[6] Iglehart, D. and Whitt, W. (1970a) Multiple channel queues in heavy traffic. Adv. Appl. Prob. 2, 150–177.CrossRefGoogle Scholar
[7] Iglehart, D. and Whitt, W. (1970b) Multiple channel queues in heavy traffic II: sequences, networks and batches. Adv. Appl. Prob. 2, 355–369.Google Scholar
[8] Kiefer, J. and Wolfowitz, J. (1956) On the characteristics of the general queueing process with applications to random walk. Ann. Math. Statist. 27, 147–161.Google Scholar
[9] Lindley, D. (1952) Theory of queues with a single server. Proc. Camb. Phil. Soc. 48, 277–289.Google Scholar
[10] Pollaczek, F. (1952) Fonctions caractéristiques de certaines répartitions définies au moyen de la notion d'ordre. Application à la théorie des attentes. C. R. Acad. Sci. Paris, 234, 2334–2336.Google Scholar
[11] Smith, W. (1955) Regenerative stochastic processes. Proc. Roy. Soc. Ser. A. 232, 6–31.Google Scholar
[12] Spitzer, F. (1956) A combinatorial lemma and its application to probability theory. Trans. Amer. Math. Soc. 82, 323–339.Google Scholar
[12a] Spitzer, F. (1964) Principles of Random Walk. Van Nostrand, Princeton.Google Scholar
[13] Strassen, V. (1964) An invariance principle for the law of the iterated logarithm, Z. Wahrscheinlichkeitsth. 3, 211–226.CrossRefGoogle Scholar
[14] 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. Sankhyā A 25 91–100.Google Scholar
[15] Whitt, W. (1968) Weak convergence theorems for queues in heavy traffic. Technical Report No. 2, Department of Operations Research, Stanford University.Google Scholar
[16] Whitt, W. (1970) Multiple channel queues in heavy traffic, III: random server selection. Adv. Appl. Prob. 2, 370–375.Google Scholar
[17] Whitt, W. (1971) Weak convergence theorems for priority queues: preemptive resume discipline. J. Appl. Prob. 8, 74–94.CrossRefGoogle Scholar