Heavy traffic theory for queues with several servers. II
- 1 June 1979
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 16 (02) , 393-401
- https://doi.org/10.1017/s0021900200046581
Abstract
The queues being studied here are of the type GI/G/k in statistical equilibrium (with traffic intensity less than one). The exponential limiting formula for the waiting time distribution function in heavy traffic, conjectured by Kingman (1965) and established by Köllerström (1974), is extended here. The asymptotic properties of the moments are investigated as well as further approximations for the characteristic function and error bounds for the limiting foemulae.Keywords
This publication has 11 references indexed in Scilit:
- Stochastic bounds for the single-server queueMathematical Proceedings of the Cambridge Philosophical Society, 1976
- On Random Walks and Stable GI / G /1 QueuesMathematics of Operations Research, 1976
- Heavy traffic theory for queues with several servers. IJournal of Applied Probability, 1974
- Multi-channel queues in heavy trafficJournal of Applied Probability, 1973
- On the algebra of queuesJournal of Applied Probability, 1966
- Some inequalities for the queue GI/G/1Biometrika, 1962
- The single server queue in heavy trafficMathematical Proceedings of the Cambridge Philosophical Society, 1961
- On the Characteristics of the General Queueing Process, with Applications to Random WalkThe Annals of Mathematical Statistics, 1956
- On the theory of queues with many serversTransactions of the American Mathematical Society, 1955
- The theory of queues with a single serverMathematical Proceedings of the Cambridge Philosophical Society, 1952