Distributing Requests by (around k)-Bounded Load-Balancing in Web Server Cluster with High Scalability

  • Authors:

  • Minhwan Ok;Myong-Soon Park

  • Affiliations:

  • The authors are with the Department of Computer Science & Engineering, Korea University, Seoul, 136--701, Korea. E-mail: panflute@korea.ac.kr, E-mail: myongsp@ilab.korea.ac.kr,;The authors are with the Department of Computer Science & Engineering, Korea University, Seoul, 136--701, Korea. E-mail: panflute@korea.ac.kr, E-mail: myongsp@ilab.korea.ac.kr,

  • Venue:
  • IEICE - Transactions on Information and Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Popular Web sites form their Web servers into Web server clusters. The Web server cluster operates with a load-balancing algorithm to distribute Web requests evenly among Web servers. The load-balancing algorithms founded on conventional periodic load-information update mechanism are not scalable due to the synchronized update of load-information. We propose a load-balancing algorithm that the load-information update is not synchronized by exploiting variant execution times of executing scripts in dynamic Web pages. The load-information of each server is updated 'individually' by a new load-information update mechanism, and the proposed algorithm supports high scalability based on this individual update. Simulation results have proven the improvement in system performance through another aspect of high scalability. Furthermore, the proposed algorithm guarantees some level of QoS for Web clients by fairly distributing requests. A fundamental merit of the proposed algorithm is its simplicity, which supports higher throughput of the Web switch.