An approximate analysis of the join the shortest queue (JSQ) policy
- 1 March 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 7 (3) , 301-307
- https://doi.org/10.1109/71.491583
Abstract
[[abstract]]This paper presents an accurate analytical model for evaluating the performance of the join the shortest queue (JSQ) policy. The system considered consists of N identical queues each of which may have single or multiple servers. A birth-death Markov process is used to model the evolution of the number of jobs in the system. Our results show that this method provides very accurate estimates of the average job response times[[fileno]]2030225010008[[department]]資訊工程學This publication has 20 references indexed in Scilit:
- The Power-Series Algorithm Applied to the Shortest-Queue ModelOperations Research, 1992
- Analysis of the asymmetric shortest queue problemQueueing Systems, 1991
- The shortest queue problemJournal of Applied Probability, 1985
- The autostrada queueing problemJournal of Applied Probability, 1984
- The shorter queue problem: A numerical study using the matrix-geometric solutionEuropean Journal of Operational Research, 1984
- A spectral method for confidence interval generation and run length control in simulationsCommunications of the ACM, 1981
- A simple dynamic routing problemIEEE Transactions on Automatic Control, 1980
- A Basic Dynamic Routing Problem and DiffusionIEEE Transactions on Communications, 1978
- Two queues in parallelCommunications on Pure and Applied Mathematics, 1977
- TWO QUEUES IN PARALLELBiometrika, 1958