By Topic

Comparison of load balancing algorithms for clustered web servers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Amjad Mahmood ; Department of Computer Science, University of Bahrain, Bahrain ; Irfan Rashid

The rapid growth of the World Wide Web has brought huge increase in traffic to popular web sites. As a consequence, end users often experience poor response time or denial of service. A cluster of multiple servers that behaves like a single host can be used to improve the throughput and alleviate the server bottlenecks. To achieve such a cluster, we need robust routing algorithms that provide scalability, effective load balancing and high availability in a constantly changing environment. Due to an ever-increasing diversity of workloads and cluster configurations, it is very difficult to propose a single algorithm that performs best under all conditions. In this paper, we review a number of proposed load balancing algorithms for clusters of web servers. We focus on an experimental analysis of the performance under a number of well-known load balancing algorithms. We study the performance of the algorithms through a simulation to evaluate their performance under different conditions and workloads. The results of our study are reported in the paper.

Published in:

Information Technology and Multimedia (ICIM), 2011 International Conference on

Date of Conference:

14-16 Nov. 2011