Application-layer anycasting: a server selection architecture and use in a replicated Web service
IEEE/ACM Transactions on Networking (TON)
Architecture and design of high volume web sites: (a brief history of IBM sport and event web sites)
SEKE '02 Proceedings of the 14th international conference on Software engineering and knowledge engineering
Optimal Scheduling of Aperiodic Jobs on Cluster
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Socket-based RR scheduling scheme for tightly coupled clusters providing single-name images
Journal of Systems Architecture: the EUROMICRO Journal
Optimizing Download Time of Embedded Multimedia Objects for Web Browsing
IEEE Transactions on Parallel and Distributed Systems
Architecting Web sites for high performance
Scientific Programming
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
ReDAL: An Efficient and Practical Request Distribution Technique for Application Server Clusters
IEEE Transactions on Parallel and Distributed Systems
DONAR: decentralized server selection for cloud services
Proceedings of the ACM SIGCOMM 2010 conference
Implementation of round robin policy in DNS for thresholding of distributed web server system
Proceedings of the International Conference & Workshop on Emerging Trends in Technology
| Hi-index | 0.00 |
A distributed Web system, consisting of multiple servers for data retrieval and a Domain Name Server (DNS) for address resolution, can provide the scalability necessary to keep up with growing client demand at popular sites. However, balancing the requests among these atypical distributed servers opens interesting new challenges. Unlike traditional distributed systems in which a centralized scheduler has full control of the system, the DNS controls only a small fraction of the requests reaching the Web site. This makes it very difficult to avoid overloading situations among the multiple Web servers. We adapt traditional scheduling algorithms to the DNS, propose new policies, and examine their impact. Extensive simulation results show the advantage of using strategies that schedule requests on the basis of the origin of the clients and very limited state information, such as whether a server is overloaded or not. Conversely, algorithms that use detailed state information often exhibit the worst performance.