[go: up one dir, main page]

Skip to main content

Quantitative Analysis of Zipf’s Law on Web Cache

  • Conference paper
Parallel and Distributed Processing and Applications (ISPA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3758))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Shi, L., Gu, Z., Wei, L., Shi, Y.: Popularity-based Selective Markov Model. In: IEEE/WIC/ACM International Conference on Web Intelligence, Beijing, pp. 504–507 (2004)

    Google Scholar 

  2. Glassman, S.: A caching relay for the World Wide Web. In: The First International World Wide Web Conference, Geneva, Switzerland (1994)

    Google Scholar 

  3. Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web caching and Zipf-like distributions: evidence and implications. In: Proceedings of INFOCOM 1999, pp. 126–134 (1999)

    Google Scholar 

  4. Huberman, B.A., Adamic, L.A.: Growth Dynamics of the World Wide Web. Nature 401, 131 (1999)

    Google Scholar 

  5. Mahanti, A., Williamson, C., Eager, D.: Traffic Analysis of a Web Proxy Caching Hierarchy. IEEE Network, 16–23 (2000)

    Google Scholar 

  6. Kelly, T., Reeves, D.: Optimal Web cache sizing: scalable methods for exact solutions. Computer Communications 24(2), 163–173 (2000)

    Article  Google Scholar 

  7. Serpanos, D.N., Karakostas, G.: Proof for effective and efficient Web caching. Electronics Letters 38(10), 490–492 (2002)

    Article  Google Scholar 

  8. Cao, P., Irani, S.: Cost Aware www proxy caching algorithms. In: Proceedings of the 1997 USENIX Symposium on Internet Technology and Systems, pp. 193–206 (1997)

    Google Scholar 

  9. Chen, X., Zhang, X.: A Popularity-based Prediction Model for Web Prefetching. Computer 36(3), 63–70 (2003)

    Article  MATH  Google Scholar 

  10. Marcatos, E.P., Chronaki, C.E.: A Top-10 Approach to Prefetching the Web. In: The Eighth Annual Conference of the Internet Society (INET 1998), Geneva, Switzerland (1998)

    Google Scholar 

  11. Shi, L., Gu, Z., Pei, Y., Wei, L.: A PPM Prediction Model Based on Web Objects’ Popularity. In: Wang, L., Jin, Y. (eds.) FSKD 2005. LNCS (LNAI), vol. 3614, pp. 110–119. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shi, L., Gu, Z., Wei, L., Shi, Y. (2005). Quantitative Analysis of Zipf’s Law on Web Cache. In: Pan, Y., Chen, D., Guo, M., Cao, J., Dongarra, J. (eds) Parallel and Distributed Processing and Applications. ISPA 2005. Lecture Notes in Computer Science, vol 3758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576235_84

Download citation

  • DOI: https://doi.org/10.1007/11576235_84

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29769-7

  • Online ISBN: 978-3-540-32100-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics