Load Balancing in Distributed Web Caching: A Novel Clustering Approach

The World Wide Web suffers from scaling and reliability problems due to overloaded and congested proxy servers. Caching at local proxy servers helps, but cannot satisfy more than a third to half of requests; more requests are still sent to original remote origin servers. In this paper we have developed an algorithm for Distributed Web Cache, which incorporates cooperation among proxy servers of one cluster. This algorithm uses Distributed Web Cache concepts along with static hierarchies with geographical based clusters of level one proxy server with dynamic mechanism of proxy server during the congestion of one cluster. Congestion and scalability problems are being dealt by clustering concept used in our approach. This results in higher hit ratio of caches, with lesser latency delay for requested pages. This algorithm also guarantees data consistency between the original server objects and the proxy cache objects.

[1]  Darrell D. E. Long,et al.  Exploring the Bounds of Web Latency Reduction from Caching and Prefetching , 1997, USENIX Symposium on Internet Technologies and Systems.

[2]  Khan Gulista,et al.  Load Balancing in Distributed Web Caching , 2010, CNSA.

[3]  Saied Hosseini-Khayat.  Improving Object Cache Performance through Selective Placement , 2006, Parallel and Distributed Computing and Networks.

[4]  Ronald C. Dodge,et al.  Prefetching Inlines to Improve Web Server Latency , 1998, Int. CMG Conference.

[5]  Zhimin Gu,et al.  Dynamic Load Balancing in Web Cache Cluster , 2008, 2008 Seventh International Conference on Grid and Cooperative Computing.

[6]  Anja Feldmann,et al.  Web proxy caching: the devil is in the details , 1998, PERV.

[7]  Margo I. Seltzer,et al.  World Wide Web Cache Consistency , 1996, USENIX Annual Technical Conference.

[8]  Michael J. Feeley,et al.  The Measured Access Characteristics of World-Wide-Web Client Proxy Caches , 1997, USENIX Symposium on Internet Technologies and Systems.