Functional limit theorems for the queue GI/G/1 in light traffic
- 1 January 1971
- journal article
- research article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 3 (02) , 269-281
- https://doi.org/10.1017/s0001867800037940
Abstract
We consider a single GI/G/1 queueing system in which customer number 0 arrives at time t 0 = 0, finds a free server, and experiences a service time v 0. The nth customer arrives at time t n and experiences a service time v n . Let the interarrival times t n - t n-1 = u n , n ≧ 1, and define the random vectors X n = (v n-1, u n ), n ≧ 1. We assume the sequence of random vectors {X n : n ≧ 1} is independent and identically distributed (i.i.d.). Let E{u n } = λ-1 and E{v n } = μ-1, where 0 < λ, μ < ∞. In addition, we shall always assume that E{v 0 2} < ∞ and that the deterministic system in which both v n and u n 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.Keywords
This publication has 11 references indexed in Scilit:
- Weak convergence theorems for priority queues: preemptive-resume disciplineJournal of Applied Probability, 1971
- Multiple channel queues in heavy trafficProbability Theory and Related Fields, 1971
- Multiple channel queues in heavy traffic. IAdvances in Applied Probability, 1970
- Multiple channel queues in heavy traffic. II: sequences, networks, and batchesAdvances in Applied Probability, 1970
- Multiple channel queues in heavy traffic. III: random server selectionAdvances in Applied Probability, 1970
- Some Invariance Principles for Functionals of a Markov ChainThe Annals of Mathematical Statistics, 1967
- An invariance principle for the law of the iterated logarithmProbability Theory and Related Fields, 1964
- A combinatorial lemma and its application to probability theoryTransactions of the American Mathematical Society, 1956
- Regenerative stochastic processesProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1955
- The theory of queues with a single serverMathematical Proceedings of the Cambridge Philosophical Society, 1952