Scalable Request Routing with Next-Neighbor Load Sharing in Multi-Server Environments

  • Authors:
  • Chung-Min Chen;Yibei Ling;Marcus Pang;Wai Chen;Shengwei Cai;Yoshihisa Suwa;Onur Altintas

  • Affiliations:
  • Telcordia Technologies;Telcordia Technologies;Telcordia Technologies;Telcordia Technologies;Toyota InfoTechnology Center, U.S.A., Inc.;Toyota InfoTechnology Center, U.S.A., Inc.;Toyota InfoTechnology Center, U.S.A., Inc.

  • Venue:
  • AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 pro-actively route individual requests to appropriate servers to best balance the load and shorten request response tame. 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 forworded 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.