Multiple channel queues in heavy traffic. II: sequences, networks, and batches
- 1 January 1970
- journal article
- research article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 2 (02) , 355-369
- https://doi.org/10.1017/s0001867800037435
Abstract
This paper is a sequel to [7], in which heavy traffic limit theorems were proved for various stochastic processes arising in a single queueing facility with r arrival channels and s service channels. Here we prove similar theorems for sequences of such queueing facilities. The same heavy traffic behavior prevails in many cases in this more general setting, but new heavy traffic behavior is observed when the sequence of traffic intensities associated with the sequence of queueing facilities approaches the critical value (ρ = 1) at appropriate rates.Keywords
This publication has 7 references indexed in Scilit:
- Limit theorems for the single server queue with traffic intensity oneJournal of Applied Probability, 1970
- Multiple channel queues in heavy traffic. III: random server selectionAdvances in Applied Probability, 1970
- Diffusion approximations and models for certain congestion problemsJournal of Applied Probability, 1968
- On limit laws for service processes in multi-channel systemsSiberian Mathematical Journal, 1967
- Some Limit Theorems in the Theory of Mass Service, II Multiple Channels SystemsTheory of Probability and Its Applications, 1965
- The single server queue in heavy trafficMathematical Proceedings of the Cambridge Philosophical Society, 1961
- Convergence of Random Processes and Limit Theorems in Probability TheoryTheory of Probability and Its Applications, 1956