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.

• Type: Conference
• Year: 2007
• Where: IPCCC
• Authors: Zhiyong Xu, Jizhong Han, Laxmi N. Bhuyan
• Keywords: Communications, Content-aware Dispatching Algorithm, Heavy Communication Overhead, IPCCC 2007, Potential Bottleneck