Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Distributed Scheduling of Tasks with Deadlines and Resource Requirements
IEEE Transactions on Computers
Static and dynamic processor scheduling disciplines in heterogeneous parallel architectures
Journal of Parallel and Distributed Computing
Toward a scalable distributed WWW server on workstation clusters
Journal of Parallel and Distributed Computing
Internet Web servers: workload characterization and performance implications
IEEE/ACM Transactions on Networking (TON)
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Analysis of Task Assignment Policies in Scalable Distributed Web-Server Systems
IEEE Transactions on Parallel and Distributed Systems
In search of reliable usage data on the WWW
Selected papers from the sixth international conference on World Wide Web
Network dispatcher: a connection router for scalable Internet services
WWW7 Proceedings of the seventh international conference on World Wide Web 7
DNS and BIND
Dynamic Load Balancing on Web-Server Systems
IEEE Internet Computing
High-Performance Web Site Design Techniques
IEEE Internet Computing
WWW Traffic Reduction and Load Balancing through Server-Based Caching
IEEE Parallel & Distributed Technology: Systems & Technology
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
Adaptive Location Policies for Global Scheduling
IEEE Transactions on Software Engineering
Enhancing the Web's Infrastructure: From Caching to Replication
IEEE Internet Computing
Lessons Learned Administering Netscape's Internet Site
IEEE Internet Computing
A scalable and highly available web server
COMPCON '96 Proceedings of the 41st IEEE International Computer Conference
Request Redirection Algorithms for Distributed Web Systems
IEEE Transactions on Parallel and Distributed Systems
On Load Balancing Approaches for Distributed Object Computing Systems
The Journal of Supercomputing
Adaptive hash routing for a cluster of client-side web proxies
Journal of Parallel and Distributed Computing
An up-to-date survey in web load balancing
World Wide Web
Dynamic load balancing method based on DNS for distributed web systems
EC-Web'05 Proceedings of the 6th international conference on E-Commerce and Web Technologies
The anatomy of LDNS clusters: findings and implications for web content delivery
Proceedings of the 22nd international conference on World Wide Web
Hi-index | 0.00 |
Replication of information across multiple servers is becoming a common approach to support popular Web sites. A distributed architecture with some mechanisms to assign client requests to Web servers is more scalable than any centralized or mirrored architecture. In this paper, we consider distributed systems in which the Authoritative Domain Name Server (ADNS) of the Web site takes the request dispatcher role by mapping the URL hostname into the IP address of a visible node, that is, a Web server or a Web cluster interface. This architecture can support local and geographical distribution of the Web servers. However, the ADNS controls only a very small fraction of the requests reaching the Web site because the address mapping is not requested for each client access. Indeed, to reduce Internet traffic, address resolution is cached at various name servers for a time-to-live (TTL) period. This opens an entirely new set of problems that traditional centralized schedulers of parallel/distributed systems do not have to face. The heterogeneity assumption on Web node capacity, which is much more likely in practice, increases the order of complexity of the request assignment problem and severely affects the applicability and performance of the existing load sharing algorithms. We propose new assignment strategies, namely adaptive TTL schemes, which tailor the TTL value for each address mapping instead of using a fixed value for all mapping requests. The adaptive TTL schemes are able to address both the nonuniformity of client requests and the heterogeneous capacity of Web server nodes. Extensive simulations show that the proposed algorithms are very effective in avoiding node overload, even for high levels of heterogeneity and limited ADNS control.