Distributing requests by (around k)-bounded load-balancing in Web server cluster with high scalability

Min Hwan Ok, Myong Soon Park

Research output: Contribution to journalArticle

6 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)663-672
Number of pages10
JournalIEICE Transactions on Information and Systems
VolumeE89-D
Issue number2
DOIs
Publication statusPublished - 2006 Feb

Keywords

  • Dynamic Web pages
  • Layer-4 Web switch
  • Load-information update
  • Scalable load-balancing
  • Web server cluster

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Distributing requests by (around k)-bounded load-balancing in Web server cluster with high scalability'. Together they form a unique fingerprint.

  • Cite this