The shortest queue problem
- 1 December 1985
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 22 (4) , 865-878
- https://doi.org/10.2307/3213954
Abstract
A Poisson stream of customers arrives at a service center which consists of two single-server queues in parallel. The service times of the customers are exponentially distributed, and both servers serve at the same rate. Arriving customers join the shortest of the two queues, with ties broken in any plausible manner. No jockeying between the queues is allowed. Employing linear programming techniques, we calculate bounds for the probability distribution of the number of customers in the system, and its expected value in equilibrium. The bounds are asymptotically tight in heavy traffic.Keywords
This publication has 6 references indexed in Scilit:
- The autostrada queueing problemJournal of Applied Probability, 1984
- Resource Sharing for Efficiency in Traffic SystemsBell System Technical Journal, 1981
- An upper bound for multi-channel queuesJournal of Applied Probability, 1977
- Two queues in parallelCommunications on Pure and Applied Mathematics, 1977
- Two Similar Queues in ParallelThe Annals of Mathematical Statistics, 1961
- TWO QUEUES IN PARALLELBiometrika, 1958