Adaptive load balancing mechanism for server cluster

Authors:
Geunyoung Park;Boncheol Gu;Junyoung Heo;Sangho Yi;Jungkyu Han;Jaemin Park;Hong Min;Xuefeng Piao;Yookun Cho;Chang Won Park;Ha Joong Chung;Bongkyu Lee;Sangjun Lee
Affiliations:
Seoul National University;Seoul National University;Seoul National University;Seoul National University;Seoul National University;Seoul National University;Seoul National University;Seoul National University;Seoul National University;Intelligent IT System Research Center, Korea Electronics Technology Institute;Intelligent IT System Research Center, Korea Electronics Technology Institute;Cheju National University;Soongsil University
Venue:
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV
Year:
2006

Citing 4
Cited 1

Analysis of Task Assignment Policies in Scalable Distributed Web-Server Systems

IEEE Transactions on Parallel and Distributed Systems
Dynamic Load Balancing on Web-Server Systems

IEEE Internet Computing
NCSA's World Wide Web Server: Design and Performance

Computer
Using smart clients to build scalable services

ATEC '97 Proceedings of the annual conference on USENIX Annual Technical Conference

HTCPNs---Based modelling and evaluation of dynamic computer cluster reconfiguration

CEE-SET'09 Proceedings of the 4th IFIP TC 2 Central and East European conference on Advances in Software Engineering Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

Server cluster provides high availability, scalability, and reliability by gathering server nodes into a group. Client requests need to be distributed to each server node fairly to maximize the performance of server cluster. In this paper, we propose an adaptive and efficient load balancing algorithm for the server cluster. The proposed algorithm computes the load of server nodes with the usages of computer resources and their weights. These weights are determined dynamically based on the statistics of the usages. The experimental result shows that the proposed algorithm can prevent the bottleneck of server cluster efficiently compared with existing algorithms. This guarantees its adaptability even though there are changes to the characteristic of service.