The state of the art in locally distributed Web-server systems
ACM Computing Surveys (CSUR)
Web transaction analysis and optimization (TAO)
WOSP '02 Proceedings of the 3rd international workshop on Software and performance
Cyclone: A High-Performance Cluster-Based Web Server with Socket Cloning
Cluster Computing
Weblins: a scalable WWW cluster-based server
Advances in Engineering Software
Online Web Cluster Capacity Estimation and Its Application to Energy Conservation
IEEE Transactions on Parallel and Distributed Systems
Journal of Systems and Software
Cache-aware load balancing for question answering
Proceedings of the 17th ACM conference on Information and knowledge management
New content-aware request distribution policies in web clusters providing multiple services
Proceedings of the 2009 ACM symposium on Applied Computing
Downward communications enhancement using a robust broadcasting mechanism
Expert Systems with Applications: An International Journal
Weblins: A scalable WWW cluster-based server
Advances in Engineering Software
An up-to-date survey in web load balancing
World Wide Web
Proceedings of the 20th international conference companion on World wide web
Decentralized content aware load balancing algorithm for distributed computing environments
Proceedings of the International Conference & Workshop on Emerging Trends in Technology
Improving the data placement algorithm of randomization in SAN
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Adaptive admission control algorithm in a QoS-aware Web system
Information Sciences: an International Journal
Hi-index | 0.00 |
Abstract: In this work, we consider a web cluster in which the content-aware distribution is performed by each of the node in a web cluster. Each server in the cluster may forward a request to another node based on the requested content. We propose a new Workload-Aware Request Distribution strategy WARD, that assigns a small set of most frequent files, called core, to be served locally, by any server in a cluster, while partitioning the rest of the files to b e served by different cluster nodes. We propose an algorithm, called ward-analysis, to compute the nearly optimal core size. The algorithm takes into account workload access patterns and cluster parameters such as number of nodes, node RAM, TCP handoff overhead, and disk access overhead. Our simulations driven by a realistic workload show that WARD achieves super-linear speedup with increased cluster size. It shows superior performance compared with traditional round-robin strategy (up to 260% increased throughput for a cluster of 16 nodes), and outperforms a pure partitioning strategy based on a cache-affinity requests distribution (up to 50% increased throughput for a cluster of 16 nodes).