Download now Free registration required
In this paper the authors consider the problem of distributed load balancing over a directed graph that is not fully connected. They study the impact of network topology on the stability and balance of distributed computing. They furthermore propose Informed Load Balancing (I-LB), an approach in which the nodes first reach an agreement over the balanced state, through using a consensus-seeking protocol, before proceeding to redistribute their tasks. They compare the performance of ILB with that of the Original Load Balancing (O-LB) approach in terms of speed of convergence and bandwidth usage.
- Format: PDF
- Size: 555.5 KB