19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers) (2005)
Mar. 25, 2005 to Mar. 30, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AINA.2005.303
Chung-Min Chen , Telcordia Technologies
Yibei Ling , Telcordia Technologies
Marcus Pang , Telcordia Technologies
Wai Chen , Telcordia Technologies
Shengwei Cai , Toyota InfoTechnology Center, U.S.A., Inc.
Yoshihisa Suwa , Toyota InfoTechnology Center, U.S.A., Inc.
Onur Altintas , Toyota InfoTechnology Center, U.S.A., Inc.
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.
W. Chen et al., "Scalable Request Routing with Next-Neighbor Load Sharing in Multi-Server Environments," 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)(AINA), Taipei, Taiwan, 2005, pp. 441-446.