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.

[1]  Ralf Diekmann,et al.  Efficient schemes for nearest neighbor load balancing , 1999, Parallel Comput..

[2]  George Cybenko,et al.  Dynamic Load Balancing for Distributed Memory Multiprocessors , 1989, J. Parallel Distributed Comput..

[3]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[4]  P.S.M. Pires,et al.  Free/open source software: an alternative for engineering students , 2002, 32nd Annual Frontiers in Education.

[5]  Bruce M. Maggs,et al.  Approximate load balancing on dynamic and asynchronous networks , 1993, STOC.

[6]  Jacques M. Bahi,et al.  Broken edges and dimension exchange algorithms on hypercube topology , 2003, Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003. Proceedings..

[7]  Robert Elsässer,et al.  Diffusion Schemes for Load Balancing on Heterogeneous Networks , 2002, Theory of Computing Systems.

[8]  L. Beineke,et al.  Selected Topics in Graph Theory 2 , 1985 .

[9]  Bruce M. Maggs,et al.  On the fault tolerance of some popular bounded-degree networks , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[10]  Frank Thomson Leighton,et al.  Coding theory, hypercube embeddings, and fault tolerance , 1991, SPAA '91.

[11]  Z. C.,et al.  Analysis of The Generalized Dimension Exchange Method forDynamic Load Balancing , 1992 .

[12]  Jacques E. Boillat,et al.  Load Balancing and Poisson Equation in a Graph , 1990, Concurr. Pract. Exp..

[13]  Francis C. M. Lau,et al.  Optimal Parameters for Load Balancing with the Diffusion Method in Mesh Networks , 1994, Parallel Process. Lett..

[14]  Jacques M. Bahi,et al.  Load Balancing on Networks with Dynamically Changing Topology , 2001, Euro-Par.

[15]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[16]  Seyed Hossein Hosseini,et al.  Analysis of a Graph Coloring Based Distributed Load Balancing Algorithm , 1990, J. Parallel Distributed Comput..

[17]  K. Vairavan,et al.  Performance Characteristics of a Load Balancing Algorithm , 1995, J. Parallel Distributed Comput..

[18]  Jacques M. Bahi,et al.  Accelerated Diffusion Algorithms on General Dynamic Networks , 2003, PPAM.