skip to main content
article

Load balancing for clustered web farms

Authors Info & Claims
Published:01 March 2001Publication History
Skip Abstract Section

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.

References

  1. V. Cardellini, M. Colajanni and P. Yu, "Dynamic Load Balancing on Web-Server Systems", IEEE Internet Computing, pp. 28-39, May-June, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. R. Garfinkel and G. Nemhauser, Integer Programming, John Wiley and Sons, 1972.Google ScholarGoogle Scholar
  4. T. Ibaraki and N. Katoh, Resource Allocation Problems - Algorithmic Approaches, The MIT Press, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  6. 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 ScholarGoogle Scholar
  7. A. Tantawi, D. Towsley and J. Wolf, "Optimal Allocation of Multiple Class Resources in Computer Systems", ACM Sigmetrics Conference, Santa Fe NM, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. Wolf and P. Yu, "On Balancing the Load in a Clustered Web Farm", IBM Research Report, 2001.Google ScholarGoogle Scholar

Index Terms

  1. Load balancing for clustered web farms
        Index terms have been assigned to the content through auto-classification.

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM SIGMETRICS Performance Evaluation Review
          ACM SIGMETRICS Performance Evaluation Review  Volume 28, Issue 4
          March 2001
          42 pages
          ISSN:0163-5999
          DOI:10.1145/544397
          Issue’s Table of Contents

          Copyright © 2001 Authors

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 March 2001

          Check for updates

          Qualifiers

          • article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader