Efficient load balancing by adaptive bypasses for the migration on the internet

Abstract

We study a dynamic load balancing problem for servers on the Internet as Grid, based on the differences of distributed computing to parallel computing. We propose an adaptive method according to initially assigned load; the optimal migration flow is directly obtained without any iterations, and the conditions of migration for the bottleneck edges are relaxed by the bypasses on a cactus adaptively extended from a spanning tree. Simulation results show that the number of rounds for the migration is decreased under 2/3 for the conventional method, and that the cost with respect to the instability of migration is also decreased in about the half. Thus, the adaptively constructed cactus is considered as a practically efficient topology. © Springer-Verlag Berlin Heidelberg 2003.