Quantitative analysis of zipf’s law on web cache

Authors:
Lei Shi;Zhimin Gu;Lin Wei;Yun Shi
Affiliations:
Department of Computer Science and Engineering, Beijing Institute of Technology, Beijing, China;Department of Computer Science and Engineering, Beijing Institute of Technology, Beijing, China;College of Information Engineering, Zhengzhou University, Zhengzhou, China;Department of Information Technology, State Post Bureau, Beijing, China
Venue:
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Year:
2005

Citing 7
Cited 2

A caching relay for the World Wide Web

Selected papers of the first conference on World-Wide Web
A Popularity-Based Prediction Model for Web Prefetching

Computer
Popularity-Based Selective Markov Model

WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Cost-aware WWW proxy caching algorithms

USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
A PPM prediction model based on web objects' popularity

FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part II
Optimal Web cache sizing: scalable methods for exact solutions

Computer Communications
Traffic analysis of a Web proxy caching hierarchy

IEEE Network: The Magazine of Global Internetworking

A Load-balancing method for network GISs in a heterogeneous cluster-based system using access density

Future Generation Computer Systems
A framework of online proxy-based web prefetching

WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.