Synchronous distributed load balancing on dynamic networks

Synchronous Distributed Load Balancing on Totally Dynamic Networks

“…In [7,8,9,10] the authors introduce two different studies of diffusion LB algorithms on networks with dynamic edges. In [8] a network with dynamic edges is represented by a graph…”

“…They also give two variants of FOS -relaxed diffusion (RFOS) [8,7] and generalized adaptive exchange (GAE) [8] -for networks with dynamic links. The relaxed diffusion algorithm is the diffusion algorithm in which a relaxation parameter β (t) is introduced.…”

“…If we only consider a volatility of edges, the diffusion algorithm converges towards the uniform load distribution according to the conditions given in [8]. Two cases must be studied for the volatility of nodes, the first one is when a node appears and the second one is when a node disappears.…”

“…These algorithms iteratively balance the load of a node with its neighbors until the whole network is globally balanced. They have been derived for use on homogeneous or heterogeneous networks [6] with fixed topologies or dynamic topologies but where the dynamism is limited to the edges of the network [7,8,9,10]. But nowadays, with grid, P2P, Ad-Hoc, sensors networks or more generally totally dynamic networks, some nodes appear or disappear in the network during its evolution.…”

“…Some edges or nodes can appear, disappear or move during the time. In our previous works on dynamic networks [8,10], the dynamism was limited to the edges. The main result of this study consists in proving that these algorithms reduce the unbalance of the system on arbitrary totally dynamic networks and converge toward the uniform load distribution if the conditions given in section 3.2 are satisfied.…”