Title :
An analysis of the join the shortest queue (JSQ) policy
Author :
Lin, Hwa-Chun ; Raghavendra, C.S.
Author_Institution :
Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan
Abstract :
An analytical method is developed to analyze the performance of the join the shortest queue (JSQ) policy for systems with N identical queues, N⩾2. No simulation result is used to refine the analytical model. A birth-death Markov process is used to model the evolution of the total number of jobs in the system. An iterative procedure is developed to estimate the average service rates for different states. The average job response time is then obtained. Extensive simulations are performed to study the accuracy of the analysis. Results show that this method provides estimates within 3.5% of the average job response times for N up to 64
Keywords :
Markov processes; performance evaluation; average job response time; average service rates; birth-death Markov process; iterative procedure; join the shortest queue; performance analysis; simulations; Analytical models; Computer science; Delay; Load management; Performance analysis; Queueing analysis; Routing; State estimation; Time measurement; Traffic control;
Conference_Titel :
Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on
Conference_Location :
Yokohama
Print_ISBN :
0-8186-2865-0
DOI :
10.1109/ICDCS.1992.235020
