Efficient replacement of nonuniform objects in web caches

Computer

Volumn 35, Issue 6, 2002, Pages 65-73

  Bahn, Hyokyung ^a   Koh, Kern ^a   Noh, Sam H ^b   Sang Lyul, Min ^a  

^a Seoul National University   (South Korea)

^b Hong Ik University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

BYTE BIT RATIO; INTERNET CACHE PROTOCOL; LEAST-UNIFIED VALUE ALGORITHM; PREFETCHING; WEB CACHES;

ALGORITHMS; COMPUTER SIMULATION; COST EFFECTIVENESS; DATA STRUCTURES; HTML; NETWORK PROTOCOLS; SERVERS; STORAGE ALLOCATION (COMPUTER); WEB BROWSERS; WORLD WIDE WEB;

CACHE MEMORY;

EID: 0036602265     PISSN: 00189162     EISSN: None     Source Type: Trade Journal    
DOI: 10.1109/MC.2002.1009170     Document Type: Article

References (8)

1. The LRU-k page replacement algorithm for database disk buffering
2. LRFU: A spectrum of policies that subsumes the least recently used and least frequently used policies
3. Replacement policies for a proxy cache
4. Cache array routing protocol v1.0
5. A taste of crispy squid
6. Exploring the bounds of web latency reduction from caching and prefetching
7. Cost-aware WWW proxy caching algorithms