Design of an efficient load balancing algorithm using the symmetric balanced incomplete block design

Maintaining load balance, in a distributed network is a complex task. It was previously assumed that the communication complexity would be O(u2)O(u2) for any number of nodes u   which was later modified as O(u32) where the number of nodes u=k2+k+1u=k2+k+1 and k   is prime. In this paper, we modify the communication complexity O(u54) where the number of nodes u=(k2+k+1)2u=(k2+k+1)2 and k   is prime. Thereby we show that by increasing the round of message interchange by 2n2n, the communication complexity is O(u1+12n). Also by increasing infinitely the round of message interchange, the communication complexity can be made O(u)O(u).