Skip to main content Accessibility help

The shortest queue problem

  • Shlomo Halfin (a1)


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.


Corresponding author

Postal address: Bell Communications Research, Room 2L-379, Morris Research and Engineering Center, Morristown, NJ 07960, USA.


Hide All
Conolly, B. W. (1984) The autostrada queueing problem. J. Appl. Prob. 21, 394403.
Flatto, L. and Mckean, H. P. (1977) Two queues in parallel. Comm. Pure. Appl. Math. 30, 255263.
Haight, F. A. (1958) Two queues in parallel. Biometrika 45, 401410.
Kingman, J. F. C. (1961) Two similar queues in parallel. Ann. Math. Statist. 32, 13141323.
Smith, D. R. and Whitt, W. (1981) Resource sharing for efficiency in traffic systems. Bell System Tech. J. 60, 3955.
Wolff, R. W. (1977) An upper bound for multi-channel queues. J. Appl. Prob. 14, 884888.


The shortest queue problem

  • Shlomo Halfin (a1)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed