Caching web objects using Zipf's law

Dimitrios N. Serpanos, Wayne H. Wolf

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

We assume that Zipf's law governs the accesses in the Web. Based on this assumption, we show that caching Web objects can lead to very high hit rates. Furthermore, we can calculate the size of the cache that is required to achieve a given hit ratio. Assuming that Zipf's law continually applies to accesses of Internet objects, we argue that a cache replacement policy based on the concept or the Least Frequently Used (LFU) object suffices to obtain the theoretically achievable results, assuming a large enough cache. Using this theory, we show how results available in the literature can be explained. We also show how a designer can make decisions and develop caching architectures for networks based on the profiles of average users. We propose clip-based caching of video objects rather than caching of complete objects. Clips are disseminated in video library and browsing environments and are small enough to be properly managed by a cache scheme based on Zipf's law.

Original languageEnglish
Title of host publicationProceedings of SPIE - The International Society for Optical Engineering
EditorsC.C. Jay Kuo, S. Fu Chang, S. Panchanathan
Pages320-326
Number of pages7
Volume3527
DOIs
Publication statusPublished - 1998
Externally publishedYes
EventMultimedia Storage and Archiving Systems III - Boston, MA, United States
Duration: 2 Nov 19984 Nov 1998

Other

OtherMultimedia Storage and Archiving Systems III
CountryUnited States
CityBoston, MA
Period2/11/984/11/98

Fingerprint

clips
Internet
profiles

Keywords

  • Cache
  • Caching
  • Internet
  • Web
  • WWW
  • Zipf's law

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Condensed Matter Physics

Cite this

Serpanos, D. N., & Wolf, W. H. (1998). Caching web objects using Zipf's law. In C. C. Jay Kuo, S. Fu Chang, & S. Panchanathan (Eds.), Proceedings of SPIE - The International Society for Optical Engineering (Vol. 3527, pp. 320-326) https://doi.org/10.1117/12.325826

Caching web objects using Zipf's law. / Serpanos, Dimitrios N.; Wolf, Wayne H.

Proceedings of SPIE - The International Society for Optical Engineering. ed. / C.C. Jay Kuo; S. Fu Chang; S. Panchanathan. Vol. 3527 1998. p. 320-326.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Serpanos, DN & Wolf, WH 1998, Caching web objects using Zipf's law. in CC Jay Kuo, S Fu Chang & S Panchanathan (eds), Proceedings of SPIE - The International Society for Optical Engineering. vol. 3527, pp. 320-326, Multimedia Storage and Archiving Systems III, Boston, MA, United States, 2/11/98. https://doi.org/10.1117/12.325826
Serpanos DN, Wolf WH. Caching web objects using Zipf's law. In Jay Kuo CC, Fu Chang S, Panchanathan S, editors, Proceedings of SPIE - The International Society for Optical Engineering. Vol. 3527. 1998. p. 320-326 https://doi.org/10.1117/12.325826
Serpanos, Dimitrios N. ; Wolf, Wayne H. / Caching web objects using Zipf's law. Proceedings of SPIE - The International Society for Optical Engineering. editor / C.C. Jay Kuo ; S. Fu Chang ; S. Panchanathan. Vol. 3527 1998. pp. 320-326
@inproceedings{cedc4df572514ec2aa941a0c69d08f44,
title = "Caching web objects using Zipf's law",
abstract = "We assume that Zipf's law governs the accesses in the Web. Based on this assumption, we show that caching Web objects can lead to very high hit rates. Furthermore, we can calculate the size of the cache that is required to achieve a given hit ratio. Assuming that Zipf's law continually applies to accesses of Internet objects, we argue that a cache replacement policy based on the concept or the Least Frequently Used (LFU) object suffices to obtain the theoretically achievable results, assuming a large enough cache. Using this theory, we show how results available in the literature can be explained. We also show how a designer can make decisions and develop caching architectures for networks based on the profiles of average users. We propose clip-based caching of video objects rather than caching of complete objects. Clips are disseminated in video library and browsing environments and are small enough to be properly managed by a cache scheme based on Zipf's law.",
keywords = "Cache, Caching, Internet, Web, WWW, Zipf's law",
author = "Serpanos, {Dimitrios N.} and Wolf, {Wayne H.}",
year = "1998",
doi = "10.1117/12.325826",
language = "English",
volume = "3527",
pages = "320--326",
editor = "{Jay Kuo}, C.C. and {Fu Chang}, S. and S. Panchanathan",
booktitle = "Proceedings of SPIE - The International Society for Optical Engineering",

}

TY - GEN

T1 - Caching web objects using Zipf's law

AU - Serpanos, Dimitrios N.

AU - Wolf, Wayne H.

PY - 1998

Y1 - 1998

N2 - We assume that Zipf's law governs the accesses in the Web. Based on this assumption, we show that caching Web objects can lead to very high hit rates. Furthermore, we can calculate the size of the cache that is required to achieve a given hit ratio. Assuming that Zipf's law continually applies to accesses of Internet objects, we argue that a cache replacement policy based on the concept or the Least Frequently Used (LFU) object suffices to obtain the theoretically achievable results, assuming a large enough cache. Using this theory, we show how results available in the literature can be explained. We also show how a designer can make decisions and develop caching architectures for networks based on the profiles of average users. We propose clip-based caching of video objects rather than caching of complete objects. Clips are disseminated in video library and browsing environments and are small enough to be properly managed by a cache scheme based on Zipf's law.

AB - We assume that Zipf's law governs the accesses in the Web. Based on this assumption, we show that caching Web objects can lead to very high hit rates. Furthermore, we can calculate the size of the cache that is required to achieve a given hit ratio. Assuming that Zipf's law continually applies to accesses of Internet objects, we argue that a cache replacement policy based on the concept or the Least Frequently Used (LFU) object suffices to obtain the theoretically achievable results, assuming a large enough cache. Using this theory, we show how results available in the literature can be explained. We also show how a designer can make decisions and develop caching architectures for networks based on the profiles of average users. We propose clip-based caching of video objects rather than caching of complete objects. Clips are disseminated in video library and browsing environments and are small enough to be properly managed by a cache scheme based on Zipf's law.

KW - Cache

KW - Caching

KW - Internet

KW - Web

KW - WWW

KW - Zipf's law

UR - http://www.scopus.com/inward/record.url?scp=0038071710&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038071710&partnerID=8YFLogxK

U2 - 10.1117/12.325826

DO - 10.1117/12.325826

M3 - Conference contribution

VL - 3527

SP - 320

EP - 326

BT - Proceedings of SPIE - The International Society for Optical Engineering

A2 - Jay Kuo, C.C.

A2 - Fu Chang, S.

A2 - Panchanathan, S.

ER -