Scalable and Decentralized Content-Aware Dispatching in Web Clusters

In this paper, we propose a novel and efficient content-aware dispatching algorithm. Our approach eliminates the potential bottleneck and the single point of failure problems completely by using totally decentralized P2P architecture. It is scalable, the system throughput increases nearly linearly with the increased number of servers. Meanwhile, it does not introduce heavy communication overhead among back-end servers which appeared in the previous decentralized mechanisms. Our simulation results show that our approach is superior to the previous solutions.

[1]  Willy Zwaenepoel,et al.  Efficient Support for P-HTTP in Cluster-Based Web Servers , 1999, USENIX Annual Technical Conference, General Track.

[2]  Zhiyong Xu,et al.  Exploiting client cache: a scalable and efficient approach to build large Web cache , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[3]  Willy Zwaenepoel,et al.  Scalable Content-aware Request Distribution in Cluster-based Network Servers , 2000, USENIX Annual Technical Conference, General Track.

[4]  James H. Burrows,et al.  Secure Hash Standard , 1995 .

[5]  Philip S. Yu,et al.  The state of the art in locally distributed Web-server systems , 2002, CSUR.

[6]  Mon-Yen Luo,et al.  A content placement and management system for distributed Web-server systems , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[7]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[8]  Michele Colajanni,et al.  A client-aware dispatching algorithm for web clusters providing multiple services , 2001, WWW '01.

[9]  Guerney D. H. Hunt,et al.  Network Dispatcher: A Connection Router for Scalable Internet Services , 1998, Comput. Networks.

[10]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1996, SIGMETRICS '96.

[11]  Ricardo Bianchini,et al.  Efficiency vs. portability in cluster-based network servers , 2001, PPoPP '01.

[12]  Erich M. Nahum,et al.  Locality-aware request distribution in cluster-based network servers , 1998, ASPLOS VIII.

[13]  Mor Harchol-Balter,et al.  On Choosing a Task Assignment Policy for a Distributed Server System , 1998, J. Parallel Distributed Comput..

[14]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[15]  Ricardo Bianchini,et al.  Analytical and experimental evaluation of cluster-based network servers , 2000, World Wide Web.

[16]  Sampath Rangarajan,et al.  On the Performance of TCP Splicing for URL-Aware Redirection , 1999, USENIX Symposium on Internet Technologies and Systems.

[17]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1997, TNET.

[18]  Margo Seltzer,et al.  HACC: an architecture for cluster-based web servers , 1999 .

[19]  Azer Bestavros,et al.  Temporal Locality in Web Request Streams , 2000 .

[20]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[21]  Diptikalyan Saha,et al.  Securing electronic commerce: reducing the SSL overhead , 2000 .

[22]  David R. Karger,et al.  Building peer-to-peer systems with chord, a distributed lookup service , 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.