Quantitative Analysis of Zipf's Law on Web Cache

Many studies have shown that Zipf’s law governs many features of the WWW and can be used to describe the popularity of the Web objects. Based upon Zipf’s law, we analyze quantitatively the relationship between the hit ratio and the size of Web cache, present approximate formulae to calculate the size of Web cache when the hit ratio is given under the condition of basic Zipf’s law and Zipf-like law, determine the critical value n in the top-n prefetching algorithm by studying the effect of parameter α on the hot Web documents. Zipf’s law plays an important role in solving the Internet latency, and holds the promise of more effective design and use of Web cache resources.

[1]  Popularity-Based Selective Markov Model , 2004, IEEE/WIC/ACM International Conference on Web Intelligence (WI'04).

[2]  Anirban Mahanti,et al.  Traffic analysis of a Web proxy caching hierarchy , 2000 .

[3]  Sandy Irani,et al.  Cost-Aware WWW Proxy Caching Algorithms , 1997, USENIX Symposium on Internet Technologies and Systems.

[4]  Douglas S. Reeves,et al.  Optimal Web cache sizing: scalable methods for exact solutions , 2001, Comput. Commun..

[5]  George Karakostas,et al.  Proof for effective and efficient Web caching , 2002 .

[6]  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).

[7]  Steven Glassman,et al.  A Caching Relay for the World Wide Web , 1994, Comput. Networks ISDN Syst..

[8]  Xin Chen,et al.  A Popularity-Based Prediction Model for Web Prefetching , 2003, Computer.

[9]  Lada A. Adamic,et al.  Internet: Growth dynamics of the World-Wide Web , 1999, Nature.

[10]  Lei Shi,et al.  A PPM Prediction Model Based on Web Objects' Popularity , 2005, FSKD.