An analysis of the join the shortest queue (JSQ) policy

Proceedings - International Conference on Distributed Computing Systems

Volumn 1992-June, Issue , 1992, Pages 362-366

  Lin, Hwa Chun ^a   Raghavendra, C S ^b  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b WASHINGTON STATE UNIVERSITY   (United States)

Author keywords

Analytical approximation; Join the shortest queue; Load balancing; Parallel queues; Performance evaluation

Indexed keywords

ITERATIVE METHODS; MARKOV PROCESSES; QUEUEING THEORY; RESOURCE ALLOCATION; RESPONSE TIME (COMPUTER SYSTEMS);

ANALYTICAL APPROXIMATION; ANALYTICAL METHOD; BIRTH-DEATH MARKOV PROCESS; EXTENSIVE SIMULATIONS; JOB RESPONSE TIME; JOIN-THE-SHORTEST-QUEUE; PARALLEL QUEUES; PERFORMANCE EVALUATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84927156222     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.1992.235020     Document Type: Conference Paper

References (14)

1. J. P. C. Blanc, "A Note on Waiting Times in Systems with Queues in Parallel, " J. Appl. Prob. 24, pp. 540-546, 1987.
2. J. W. Cohen and O. J. Boxma, Boundary Value Problems in Queueing System Analysis, North-Holland Publishing Company, 1983.
3. A. Ephremides and P. Walrand, "A simple Dynamic Routing problem, " IEEE Trans, on Automatic Control, vol. AC-25, pp. 690-693, Aug. 1980.
4. L. Flatto and H. P. McKean, "Two Queues in Parallel, " Communication on Pure and Applied Mathematics, vol. 30, pp. 255-263, 1977.
5. S. Halfin, "The Shortest Queue problem, " J. Appl. Prob. 22, pp. 865-878, 1985.
6. G. J. Foschini and J. Salz, "A Basic Dynamic Routing Problem and Diffusion, " IEEE Trans, on Communications, vol. COM-26, pp. 320-327, May 1978.
7. I. Gertsbakh, "The Shorter Queue Problem: A Numerical Study Using the Matrix- Geometric Solution, " European Journal of Operational Research, vol. 15, pp. 374-381, 1984.
8. P. Heidelberger and D. Welch, "A Spectral Method for Confidence Interval Generation and Run Length Control in Simulations, " Communications of the ACM, vol. 24, no. 4, pp. 233-245, April 1981.
9. J. F. C. Kingman, "Two Similar Queues in Parallel, " Ann. Math. Stat, 32, pp. 1314-1323, 1961.
10. C. Knessl, B. J. Matkowsky, Z. Schuss, and C. Tier, "Two Parallel M/G/l Queues Where Arrivals Join the Systems with the Smaller Buffer Content, " IEEE Trans, on Communications, vol. COM-35, pp. 1153-1158, Nov. 1987.
11. R. D. Nelson and T. K. Philips, "An Approximation to the Response Time for Shortest Queue Routing, " ACM Performance Evaluation Review, Vol. 17, pp. 181-189, May 1989.
12. M. F. Neuts, Matrix-Geometric Solutions in Stochastic Models, John Hopkins University Press, Baltimore, MD, 1981.
13. B. M. Rao and M. J. M. Posner, "Algorithmic and Approximation Analyses of the Shorter Queue Model, " Naval Research Logistic, vol. 34, pp. 381-398, 1987.
14. W. Winston, "Optimality of the Shortest Line Discipline, " J. Appl. Prob. 14, pp. 181-189, 1977.