A Load Balancing Algorithm for Web Based Server Grids

Load balance is a critical issue in distributed systems, such as server grids. In this paper, we propose a Balanced Load Queue (BLQ) model, which combines the queuing theory and hydro-dynamic theory, to model load balance in server grids. Base on the BLQ model, we claim that if the system is in the state of global fairness, then the performance of the whole system is the best. We propose a load balanced algorithm based on the model: the algorithm tries its best to keep the system in the global fairness status using job deviation. We present three strategies: best node, best neighbour, and random selection, for job deviation. A number of experiments are conducted for the comparison of the three strategies, and the results show that the best neighbour strategy is the best among the proposed strategies. Furthermore, the proposed algorithm with best neighbour strategy is better than the traditional round robin algorithm in term of processing delay, and the proposed algorithm needs very limited system information and is robust.

[1]  Craig Partridge,et al.  Host Anycasting Service , 1993, RFC.

[2]  Alan M. Frieze,et al.  Balls and bins models with feedback , 2002, SODA '02.

[3]  Jie Wang,et al.  Managing performance using weighted round-robin , 2000, Proceedings ISCC 2000. Fifth IEEE Symposium on Computers and Communications.

[4]  Samuel T. Chanson,et al.  Efficient load balancing in interconnected LANs using group communication , 1997, Proceedings of 17th International Conference on Distributed Computing Systems.

[5]  Chi-Ying Tsui,et al.  Stable round-robin scheduling algorithms for high-performance input queued switches , 2002, Proceedings 10th Symposium on High Performance Interconnects.

[6]  Samuel T. Chanson,et al.  A hydro-dynamic approach to heterogeneous dynamic load balancing in a network of computers , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

[7]  K. Vairavan,et al.  On a load balancing algorithm based on edge coloring , 1997, Proceedings The Twenty-Ninth Southeastern Symposium on System Theory.

[8]  Sándor Molnár,et al.  CAC algorithm based on advanced round robin method for QoS networks , 2001, Proceedings. Sixth IEEE Symposium on Computers and Communications.

[9]  Wanlei Zhou,et al.  An Efficient Algorithm for Application-Layer Anycasting , 2002, DCW.

[10]  Michael Mitzenmacher,et al.  Load Balancing and Density Dependent Jump Markov Processes EXTENDED ABSTRACT , 1996, FOCS 1996.

[11]  Michael Mitzenmacher,et al.  The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..

[12]  Wanlei Zhou,et al.  Efficient algorithm for mobile multicast using anycast group , 2001 .

[13]  Weijia Jia,et al.  A Routing Protocol for Anycast Messages , 2000, IEEE Trans. Parallel Distributed Syst..

[14]  Eli Upfal,et al.  Balanced Allocations , 1999, SIAM J. Comput..