Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Quantitative Analysis of Zipf’s Law on Web Cache
verfasst von : Lei Shi, Zhimin Gu, Lin Wei, Yun Shi
Erschienen in: Parallel and Distributed Processing and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.