Scalable request routing with next-neighbor load sharing in multi-server environments

Load balancing for distributed servers is a common issue in many applications and has been extensively studied. Several distributed load balancing schemes have been proposed that proactively route individual requests to appropriate servers to best balance the load and shorten request response time....

Full description

Saved in:
Bibliographic Details
Main Authors: Chung-Min Chen, Yibei Ling, Pang, M., Wai Chen, Shengwei Cai, Suwa, Y., Altintas, O.
Format: Conference Proceeding
Language:English
Subjects:
Computational modeling
Delay
Drives
Grid computing
Internet
Load management
Load modeling
Network servers
Routing
Web server
Citations: Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Load balancing for distributed servers is a common issue in many applications and has been extensively studied. Several distributed load balancing schemes have been proposed that proactively route individual requests to appropriate servers to best balance the load and shorten request response time. These schemes do not require a centralized load balancer. Instead, each server is responsible for determining, for each request it receives from a client, to which server in the pool the request should be forwarded for processing. We propose a new request routing scheme that is more scalable to increasing number of servers and request load than the existing schemes. The method combines random server selection and next-neighbor load sharing techniques that together prevent the staleness of load information from building up when the number of servers increases. Our simulation shows that it outperforms existing schemes under a piggyback-based load update model.
ISSN:1550-445X
2332-5658
DOI:10.1109/AINA.2005.303