An Adaptive Load Balancing Algorithm Based on Discrete Uniform Distribution

Abstract:

Centralized cluster system is widely used by many web sites to increase service availability and balancing workload among multiple servers. In order to reduce the possibility which balancer becomes performance bottleneck in clusters, a dynamic adaptive weighted load-balanced algorithm is presented in this paper. The objective of the algorithm is that every working server sends a corresponding ask signals at different rates to balancer based on the discrete uniform distribution principle and the balancer assigning user requests according to an ask queue which consists of these signals and achieves the dynamic negative feedback on workload. Experiment results show that the algorithm is better than the static algorithm, as compared with the dynamic algorithm, it can also reduce the burden on load balancer.

• Periodical: Advanced Materials Research (Volumes 108-111)
• Pages: 1392-1396
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.108-111.1392
• Online since: May 2010
• Authors: Hai Sheng Li, Hong Yan Shi
• Keywords: Ask Queue, Cluster, Discrete Uniform Distribution, Load Balancing

References

[1] S. Sharma, S. Singh, and M. Sharma: Performance Analysis of Load Balancing Algorithms (World Academy of Science, Engineering and Technology, vol. 38, 2008, pp.269-272).

[2] Chen LC, Choi HA : Approximation algorithms for data distribution with 1oad balance of Web servers (Proceedings of IEEE International Conference on Cluster Computing, 2001, pp.274-281).

DOI: 10.1109/clustr.2001.959988

[3] Hu Hong-Chao, Yi Peng , Guo Yun-Fei et al: Fair service and dynamic round robin scheduling algorithm (Journal of Software, Vol. 19, 2008, pp.1856-1864).

DOI: 10.3724/sp.j.1001.2008.01856

[4] Y. -T. Wang and A. -R. J. T. Morris : Load Sharing in Distributed Systems (IEEE Transactions on Computers, vol. 34, p.204.