Distributed Load Balancing Based on Modified Local Voting Protocol

Elena Borisoglebskaya, Victoria Erofeeva, Oleg N. Granichin, Yury Ivanskiy, Natalia Kizhaeva

Abstract: The problem of load balancing in a distributed network is considered. The network operates in discrete time under the influence of noise in communication channels. The node's load is formulated as a function of the node's operation parameters and the value of this function is exchanged locally among the node's neighbors. Each node, based on comparison of its load and the neighbors' loads, exchanges the tasks with its neighbors so that the load is averaged across the network. The step-size of the load adjustment procedure is chosen via fast gradient like Nesterov algorithm to achieve faster convergence. The algorithm divergence upper bound is estimated. The simulation results suggest faster convergence of the proposed algorithm.