Abstract
We propose a scheme which attempts to optimally balance the load on the servers of a clustered web farm. Solving this performance problem is crucial to achieving minimal average response time for customer requests, and thus ultimately to achieving maximal customer throughput. This short paper gives an overview of three new mathematical contributions. First, we describe a goal setting algorithm to determine the load on each server which minimizes the average customer request response time given the possibly overlapping cluster assignments of sites to servers and the current customer request load for each site. The cluster assignments, which of necessity can only be changed relatively infrequently, have a major effect on the optimal response time in the goal setting component. So, second, we describe a static algorithm which determines good assignments of sites to servers. Third, and finally, we describe a dynamic algorithm which handles the real-time server load balancing, reacting to the fluctuating customer request load in order to come as close as possible to achieving the idealized optimal average response time. We examine the performance of the overall load balancing scheme via simulation experiments.
- V. Cardellini, M. Colajanni and P. Yu, "Dynamic Load Balancing on Web-Server Systems", IEEE Internet Computing, pp. 28-39, May-June, 1999. Google ScholarDigital Library
- A. Federgruen and H. Groenevelt, "The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality", Operations Research, vol. 34, pp. 909-918, 1986. Google ScholarDigital Library
- R. Garfinkel and G. Nemhauser, Integer Programming, John Wiley and Sons, 1972.Google Scholar
- T. Ibaraki and N. Katoh, Resource Allocation Problems - Algorithmic Approaches, The MIT Press, 1988. Google ScholarDigital Library
- A. Iyengar, M. Squillante and L. Zhang, "Analysis and Characterization of Large-Scale Web Server Access Patterns and Performance", World Wide Web, vol. 2, pp. 88-100, 1999. Google ScholarDigital Library
- G. Schmunek, D. Dupuche, T. Fung, E. Myhra and H. Stein, "Slicing the AS/400 with LPARS", IBM Redbook SG24-5439-00, Armonk, NY, 1999.Google Scholar
- A. Tantawi, D. Towsley and J. Wolf, "Optimal Allocation of Multiple Class Resources in Computer Systems", ACM Sigmetrics Conference, Santa Fe NM, 1988. Google ScholarDigital Library
- J. Wolf and P. Yu, "On Balancing the Load in a Clustered Web Farm", IBM Research Report, 2001.Google Scholar
Index Terms
- Load balancing for clustered web farms
Recommendations
On balancing the load in a clustered web farm
In this article we propose a novel, yet practical, scheme which attempts to optimally balance the load on the servers of a clustered Web farm. The goal in solving this performance problem is to achieve minimal average response time for customer requests,...
Load Balancing on Stateful Clustered Web Servers
SBAC-PAD '03: Proceedings of the 15th Symposium on Computer Architecture and High Performance ComputingOne of the main challenges to the wide use of the Internet is the scalability of the servers, that is, their ability to handle the increasing demand. Scalability in stateful servers, which comprise e-Commerce and other transaction-oriented servers, is ...
Workload-Aware Load Balancing for Clustered Web Servers
We focus on load balancing policies for homogeneous clustered Web servers that tune their parameters on-the-fly to adapt to changes in the arrival rates and service times of incoming requests. The proposed scheduling policy, AdaptLoad, monitors the ...
Comments