Milan E. Soklic
Abstract
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.
- W. Winston. Optimality of the Shortest Line Discipline. Journal of Applied Probability, 14 (1), 1977.Google Scholar
- William Mendenhall, Dennis D. Wackerly, and Richard L. Schaeffer. Mathematical Statistics with Applications, 4th edition. Duxbury Press, 1990.Google Scholar
- Randolph D. Nelson and Thomas K. Philips. An Approximation to the Response Time for Shortest Queue Routing. Performance Evaluation Review, 17(1):181--189, May 1989. Google ScholarDigital Library
Recommendations
An adaptive load balancing management technique for RFID middleware systems
In recent years, Radio Frequency Identification (RFID) industries have taken a great interest in utilizing the benefits of RFID for supply chain management, inventory control and various other applications. This paper proposed an adaptive load balancing ...
Resource Scheduling and Load Balancing Algorithms in Cloud Computing
AbstractA technology called cloud computing makes it possible to offer computing resources including storage, software, and services over the internet. Users can access these resources whenever they need them and just pay for what they actually use. There ...
Comments