Advances in Applied Probability · 1971 · 20 citations · 12 references
EngineeringComputer ScienceMathematicsProbability TheoryQueuing TheoryStochastic ProcessesLimit TheoremsMarkov ChainsMarkov ProcessesQueueing ProcessesQueueing SystemsQueueing TheoryAsymptotic Analysis Of QueuesFinite Markov ChainsG/g/1 QueuesHeavy Traffic TheoryHeavy-traffic Waiting Time AnalysisLimitsTraffic IntensityVirtual Waiting Time Approximation
Investigations in the theory of heavy traffic were initiated by Kingman ([5], [6] and [7]) in an effort to obtain approximations for stable queues. He considered the Markov chains { W n i } of a sequence { Q i } of stable GI/G/ 1 queues, where W n i is the waiting time of the n th customer in the i th queueing system, and by making use of Spitzer's identity obtained limit theorems as first n → ∞ and then ρ i ↑ 1 as i → ∞. Here &rH i is the traffic intensity of the i th queueing system. After Kingman the theory of heavy traffic was developed by a number of Russians mainly. Prohorov [10] considered the double sequence of waiting times { W n i } and obtained limit theorems in the three cases when n 1/2 (ρ i -1) approaches (i) - ∞, (ii) -δ and (iii) 0 as n → ∞ and i → ∞ simultaneously. The case (i) includes the result of Kingman. Viskov [12] also studied the double sequence { W n i } and obtained limits in the two cases when n 1/2 (ρ i − 1) approaches + δ and + ∞ as n → ∞ and i → ∞ simultaneously.
12
<i>The Theory of Stochastic Processes</i>
D. R. Cox, H. D. Miller, George H. Weiss et al. · Physics Today · 1966 · 3.4K citations
The theory of stochastic processes
A. Papoulis · Journal of the Franklin Institute · 1966 · 701 citations
Engineering, Mathematics, Physics +12
Combinatorial Methods in the Theory of Stochastic Processes
S. Zacks, L Takács, L Takács · Technometrics · 1968 · 517 citations