Efficient load balancing algorithm using complete graph

Abstract

For load balancing process in a distributed network consisting of v nodes it requires O(v 2) communication complexity. Here we present a new synchronous dynamic distributed load balancing algorithm on a network having v = k 2 nodes, where k(≥ 2) is any positive integer. Our algorithm needs a complete graph of k nodes for an efficient communication system. Each node receives workload information from all other nodes with two-round message interchange without redundancy and hence it requires O(v√v) communication complexity. © 2011 Springer-Verlag.