Lookup NU author(s): Michael Hamilton,
Emeritus Professor Isi Mitrani
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Web objects are stored in a local cache in order to reduce the cost of future accesses. The cache size is limited, so it is necessary to have a policy for replacing old objects with new ones. This paper examines the problem of constructing optimal or near-optimal replacement policies. Different objects are accessed with different frequencies, and have different retrieval costs when not in the cache. In addition, an object which remains in the cache for a long period may become out of date as its original version is modified. The optimization problem which takes these factors into account is formulated as a Markov decision process. For small cache sizes and small numbers of objects, an optimal replacement policy can be computed by solving the corresponding dynamic programming equation. That solution is compared with a number of heuristics, some of which achieve a near-optimal performance.
Author(s): Hamilton MD, McKee P, Mitrani I
Editor(s): Hertzberger, L.O., Hoekstra, A.G., Williams, R.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: 9th International Conference High-Performance Computing and Networking (HPCN Europe)
Year of Conference: 2001
ISSN: 0302-9743 (Print) 1611-3349 (Online)
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science