Knapsack-model-based Schemes and WLB Algorithm for the Capacity and Efficiency Management of Web Cache

Web cache refers to the temporary storage of web files/documents. In reality, a set of caches can be grouped into a cluster to improve the server system's performance. In this paper, to achieve the overall cluster efficiency, we propose a weighted load balancing (WLB) routing algorithm by considering both the cache capability and the content property to determine how to direct an arrival request to the right node. Based on Knapsack models, we characterize three new placement/replacement schemes for Web contents caching and then conduct the comparison based on WLB algorithm. We also compare WLB algorithm with two other widely used algorithms: Pure load balancing (PLB) algorithm and Round-Robin (RR) algorithm. Extensive simulation results show that the WLB algorithm works well under the examined cluster content placement/replacement schemes. It generally results in shorter response time and higher cache hit ratio, especially when the cache cluster capacity is scarce.

[1]  Keith W. Ross,et al.  Stochastic fluid models for cache clusters , 2005, Perform. Evaluation.

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

[3]  Dimitris Bertsimas,et al.  An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems , 2002, Manag. Sci..

[4]  Arie Shoshani,et al.  Disk Cache Replacement Algorithm for Storage Resource Managers in Data Grids , 2002, ACM/IEEE SC 2002 Conference (SC'02).

[5]  Don Towsley,et al.  Proxy-Based Distribution of Streaming Video Over Unicast/Multicast Connections TITLE2: , 2001 .

[6]  Chetan Kumar,et al.  A new approach for a proxy-level web caching mechanism , 2008, Decis. Support Syst..

[7]  Armand M. Makowski,et al.  Optimal replacement policies for nonuniform cache objects with optional eviction , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[8]  Anindya DattaKaushik.  World Wide Wait: A Study of Internet Scalability and Cache-Based Approaches to Alleviate It , 2003 .

[9]  Ming Lei,et al.  Clustering Web Accelerators , 2002, Proceedings Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002).

[10]  Anbo Xiang.  Essays on information service systems , 2006 .

[11]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).