Synchronous distributed load balancing on dynamic networks
In this paper, three distributed load-balancing algorithms for dynamic networks are investigated. Dynamic networks are networks in which the topology may change dynamically. The definition of a dynamic network is introduced and its graph model is presented. The main result of this study consists in proving the convergence toward the uniform load distribution of the diffusion algorithm on an arbitrary dynamic network despite communication link failures. We also give two adaptations of this algorithm (the GAE and the relaxed diffusion). Note that the hypotheses of our result are realistic and that for example the network does not have to be maintained connected. To study the behavior of these algorithms, we compare the load evolution by several simulations.
load balancing dynamic networks iterative algorithm first order dimension exchange