Abstract
Exact performance analyses of dynamic load-balancing policies for distributed systems is known to be very difficult due to the facts that the state space is multidimensional and that load-balancing decisions are state-dependent. In this paper, a state-aggregation method is proposed to analyze the performance of dynamic load-balancing policies. Those states with the same number of jobs are aggregated into a single state. The number of jobs in the system is modeled by a birth-death Markov process. The state transition rates are estimated by an iterative procedure. The proposed state-aggregation method is applied to analyze the performance of a dynamic load-balancing policies, namely, symmetric policy with threshold value equal to one. Extensive simulations are performed to study the accuracy of the state-aggregation method. This method provides accurate performance estimates for the symmetric policy for systems of various sizes when the mean job transfer delay is small compared to the average job service time.