Application-layer anycasting: a server selection architecture and use in a replicated Web service
IEEE/ACM Transactions on Networking (TON)
Realizing fault resilience in Web-server cluster
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Distributed cooperative Apache web server
Proceedings of the 10th international conference on World Wide Web
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Efficient support for content-based routing in web server clusters
USITS'99 Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2
Effect of Database Server Arrangement to the Performance of Load Balancing Systems
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Designing next generation data-centers with advanced communication protocols and systems services
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
SecureTorrent: a security framework for file swarming
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Enabling fault resilience for web services
Computer Communications
| Hi-index | 0.00 |
With ever increasing web traffic, a distributed Web system can provide scalability and flexibility to cope with growing client demands. Load balancing algorithms to spread the load across multiple Web servers are crucial to achieve the scalability. Various domain name server (DNS) based schedulers have been proposed in the literature, mainly for multiple homogeneous servers. DNS provides (logical) host name to IP-address mapping (i.e., the server assignment), but the mapping is not done for each server access. This is because the address mapping is cached for a time-to-live (TTL) period to reduce network traffic. The presence of heterogeneous Web servers not only increases the complexity of the DNS scheduling problem, but also makes previously proposed algorithms for homogeneous distributed systems such as round robin not directly applicable. This leads us to propose new policies, called adaptive TTL algorithms, that take both the uneven distribution of client request rates and heterogeneity of Web servers into account to adaptively set the TTL value for each address mapping request. Extensive simulation results show that these strategies are effective in balancing load among geographically distributed heterogeneous Web servers.