Efficient replacement of nonuniform objects in web caches

Hyokyung Bahn, Kern Koh, Sam H. Noh, Min Sang Lyul

Research output: Contribution to specialist publicationArticle

75 Scopus citations


Cache performance depends heavily on replacement algorithms, which dynamically select a suitable subset of objects for caching in a finite space. Developing such algorithms for wide-area distributed environments is challenging because, unlike traditional paging systems, retrieval costs and object sizes are not necessarily uniform. This paper presents the least-unified value algorithm, which performs better than existing algorithms for replacing nonuniform data objects in wide-area distributed environments.

Original languageEnglish
Number of pages9
Specialist publicationComputer
StatePublished - Jun 2002


Dive into the research topics of 'Efficient replacement of nonuniform objects in web caches'. Together they form a unique fingerprint.

Cite this