A scalable HTTP server: the NCSA prototype
Selected papers of the first conference on World-Wide Web
Locality-aware request distribution in cluster-based network servers
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
A scalable and highly available web server
COMPCON '96 Proceedings of the 41st IEEE International Computer Conference
FLEX: Load Balancing and Management Strategy for Scalable Web Hosting Service
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Distributed Packet Rewriting and its Application to Scalable Server Architectures
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
Scalable content-aware request distribution in cluster-based networks servers
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
HACC: an architecture for cluster-based web servers
WINSYM'99 Proceedings of the 3rd conference on USENIX Windows NT Symposium - Volume 3
| Hi-index | 0.00 |
This paper addresses a distribution strategy for an Internet server cluster where the content-adaptive distribution is performed by each of the front-end node in the cluster. The system architecture considered here is a hybrid one consisting of a set of logical front-end dispatcher nodes and a set of back-end server nodes. Each front-end node in the cluster may service a request locally or forward it to another node based on the request content. This paper suggests a new distribution strategy called CARD (Content-Adaptive Request Distribution) that assigns most frequently used files to be hot which is served locally on each front-end node, while making the rest of the files to be partitioned and served among the back-end nodes. We present and evaluate the optimal configuration and hot size. The approach takes into account the file access patterns and the cluster parameters such as the number of nodes, node memory, TCP handoff overheads, data consistency overheads and disk access overheads. The simulation results show that the CARD achieves a linear speedup with the cluster size and that the CARD outperforms both the traditional centralized and distributed strategies, and outperforms a pure partitioning and replication strategy.