Simulation of load balancing algorithms: a comparative study
暂无分享,去创建一个
This article introduces a new load balancing algorithm, called diffusive load balancing, and compares its performance with three other load balancing algorithms: static, round robin, and shortest queue load balancing. The comparison of load balancing algorithms is made in three simulated client-server environments: a small-scale, intranet, and Internet environment. Experimental results of performance modeling show that diffusive load balancing is better than round robin and static load balancing in a dynamic environment, which manifest in frequent clients' object creation requests and in short objects' lifetimes. In this research, the diffusive load balancing algorithm is discussed in juxtaposition with the distributed client-server architectures.
[1] Randolph D. Nelson,et al. An approximation to the response time for shortest queue routing , 1989, SIGMETRICS '89.
[2] G. Meek. Mathematical statistics with applications , 1973 .
[3] Tapani Lehtonen,et al. On the optimality of the shortest line discipline , 1984 .
[4] H. Toutenburg,et al. Mathematical statistics with applications, 4th edition : Mendenhall, W., Wackerly, D.D., Schaeffer, R.L., PWS-KENT Publishing Company, Boston (1990),752 pp,ISBN 0-534-92026-8 , 1992 .