Share Email Print

Proceedings Paper

Static caching of Web servers
Author(s): Zhen Liu; Philippe Nain; Nicolas Niclausse; Don Towsley
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

With the increasing popularity of the World Wide Web, the amount of information available and the use of Web servers are growing exponentially. As a consequence, the number of requests to popular Web servers increases exponentially as well. In order to reduce the overhead induced by frequent requests to the same documents, server caching, also referred to as main memory caching, has been proposed and implemented. In this work, we propose a static caching mechanism which consists of updating the contents of the cache periodically and, at the update time, brings into the cache only the most requested documents in the previous time interval. This caching policy has lower management overhead than others. Under some statistical assumptions we show that static caching has the highest hit rate. We also provide empirical comparison results obtained by trace-driven simulations. It turns out that static caching is more efficient in terms of hit rate than those analyzed in the literature.

Paper Details

Date Published: 29 December 1997
PDF: 12 pages
Proc. SPIE 3310, Multimedia Computing and Networking 1998, (29 December 1997); doi: 10.1117/12.298419
Show Author Affiliations
Zhen Liu, INRIA Ctr. Sophia Antipolis (France)
Philippe Nain, INRIA Ctr. Sophia Antipolis (France)
Nicolas Niclausse, INRIA Ctr. Sophia Antipolis (France)
Don Towsley, Univ. of Massachusetts/Amherst (United States)

Published in SPIE Proceedings Vol. 3310:
Multimedia Computing and Networking 1998
Kevin Jeffay; Dilip D. Kandlur; Timothy Roscoe, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?