Broken edges and dimension exchange algorithms on hypercube topology

In this paper a new method of distributed load balancing is given. This method could be described as a generalization of the dimension exchange on hypercube topologies with dynamic links. A network with dynamic links assumes that edges of the topology may be broken down, but no processor is dynamically added on the network. We suppose that the topology of the network is a hypercube in the physical or logical sense, i.e. the communication channels are organized as a hypercube. The main result of this paper consists in proving the convergence toward the uniform load distribution of a dimension exchange algorithm on hypercubes with broken edges. We need few conditions for the convergence and these conditions are close to real situations. To study the behavior of this method, we achieve a simulation on a real network and we compare the results with a simulation of the classical dimension exchange without broken links. These simulations illustrate the convergence of the method and show the irregularity of convergence due to the broken edges.