@misc{6b3e1a83923a4e86a268817ce0471a01,
title = "Efficient replacement of nonuniform objects in web caches",
abstract = "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.",
author = "Hyokyung Bahn and Kern Koh and Noh, {Sam H.} and {Sang Lyul}, Min",
note = "Funding Information: We thank NLANR and DEC for making their proxy traces available; without their generosity, this work would not exist. Many thanks also to the reviewers for their constructive and enlightening comments. This article was supported in part by Korea{\textquoteright}s Ministry of Education under the Brain Korea 21 program and by the Ministry of Science and Technology under the National Research Laboratory program.",
year = "2002",
month = jun,
doi = "10.1109/MC.2002.1009170",
language = "English",
volume = "35",
pages = "65--73",
journal = "Computer",
issn = "0018-9162",
publisher = "IEEE Computer Society",
}