Agent-based fair load distribution in linux web server cluster

Kyeongmo Kang, Minhwan Ok, Myong Soon Park

Research output: Contribution to journalArticle

Abstract

Clustering the replicated Web servers is appropriate way to build a Web information system. An LVS(Linux Virtual Server) operating with software clustering technology provides the Web service based on Linux environment. The LVS is the centralized structure, which the load should be distributed to the real servers by a load balancer. A round-robin scheduling method or a least-connection scheduling method may cause a load imbalance amongst the real servers since such methods distribute the load to the real servers without considering the actual load of real servers. In this paper, we propose a fair load distribution scheme that can distribute the requests even fair than ABSS that was early proposed to solve the problem of scheduling methods in the LVS.

Original languageEnglish
Pages (from-to)143-152
Number of pages10
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2918
Publication statusPublished - 2004 Dec 1

Fingerprint

Load Distribution
Web Server
Linux
Servers
Server
Cluster Analysis
Scheduling
Songbirds
Information Systems
Clustering
Software
Technology
Web Services
Web services
Information systems

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{d660878f0180468cbc83199bc4e19c5d,
title = "Agent-based fair load distribution in linux web server cluster",
abstract = "Clustering the replicated Web servers is appropriate way to build a Web information system. An LVS(Linux Virtual Server) operating with software clustering technology provides the Web service based on Linux environment. The LVS is the centralized structure, which the load should be distributed to the real servers by a load balancer. A round-robin scheduling method or a least-connection scheduling method may cause a load imbalance amongst the real servers since such methods distribute the load to the real servers without considering the actual load of real servers. In this paper, we propose a fair load distribution scheme that can distribute the requests even fair than ABSS that was early proposed to solve the problem of scheduling methods in the LVS.",
author = "Kyeongmo Kang and Minhwan Ok and Park, {Myong Soon}",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "2918",
pages = "143--152",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Agent-based fair load distribution in linux web server cluster

AU - Kang, Kyeongmo

AU - Ok, Minhwan

AU - Park, Myong Soon

PY - 2004/12/1

Y1 - 2004/12/1

N2 - Clustering the replicated Web servers is appropriate way to build a Web information system. An LVS(Linux Virtual Server) operating with software clustering technology provides the Web service based on Linux environment. The LVS is the centralized structure, which the load should be distributed to the real servers by a load balancer. A round-robin scheduling method or a least-connection scheduling method may cause a load imbalance amongst the real servers since such methods distribute the load to the real servers without considering the actual load of real servers. In this paper, we propose a fair load distribution scheme that can distribute the requests even fair than ABSS that was early proposed to solve the problem of scheduling methods in the LVS.

AB - Clustering the replicated Web servers is appropriate way to build a Web information system. An LVS(Linux Virtual Server) operating with software clustering technology provides the Web service based on Linux environment. The LVS is the centralized structure, which the load should be distributed to the real servers by a load balancer. A round-robin scheduling method or a least-connection scheduling method may cause a load imbalance amongst the real servers since such methods distribute the load to the real servers without considering the actual load of real servers. In this paper, we propose a fair load distribution scheme that can distribute the requests even fair than ABSS that was early proposed to solve the problem of scheduling methods in the LVS.

UR - http://www.scopus.com/inward/record.url?scp=35048863844&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35048863844&partnerID=8YFLogxK

M3 - Article

VL - 2918

SP - 143

EP - 152

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -