Approximation to the response time for shortest queue routing

Abstract

We derive an approximation for the mean response time of a multiple queue system in which shortest queue routing is used. We assume there are K identical queues with infinite capacity and service times that are exponentially distributed. Arrivals of jobs to this system are Poisson and are routed to a queue of minimal length. We develop an approximation which is based on both theoretical and experimental considerations and, for K ≤ 8, has a relative error of less than one half of one percent when compared to simulation. For K = 16, the relative error is still acceptable, being less than 2 percent. An application to a model of parallel processing and a comparison of static and dynamic load balancing schemes are presented.