Directory Structures for Scalable Internet Caches

Directory Structures for Scalable Internet Caches (1997)

Cached

Download Links

by Syam Gadde , Syam Gadde , Jeff Chase , Jeff Chase , Michael Rabinovich , Michael Rabinovich

Citations:

24 - 4 self

Versions

Version History

Metadata Version 4

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Directory Structures for Scalable Internet Caches	user correction - Legacy Corrections
AUTHOR NAME	Syam Gadde	SVM HeaderParse 0.1
AUTHOR AFFIL	Dept. of Computer Science; Duke University	SVM HeaderParse 0.2
AUTHOR ADDR	Durham NC, 27708	SVM HeaderParse 0.2
AUTHOR NAME	Syam Gadde	SVM HeaderParse 0.1
AUTHOR AFFIL	Dept. of Computer Science; Duke University	SVM HeaderParse 0.2
AUTHOR ADDR	Durham NC, 27708	SVM HeaderParse 0.2
AUTHOR NAME	Jeff Chase	SVM HeaderParse 0.1
AUTHOR AFFIL	Dept. of Computer Science; Duke University	SVM HeaderParse 0.2
AUTHOR ADDR	Durham NC, 27708	SVM HeaderParse 0.2
AUTHOR NAME	Jeff Chase	SVM HeaderParse 0.1
AUTHOR AFFIL	Dept. of Computer Science; Duke University	SVM HeaderParse 0.2
AUTHOR ADDR	Durham NC, 27708	SVM HeaderParse 0.2
AUTHOR NAME	Michael Rabinovich	SVM HeaderParse 0.1
AUTHOR AFFIL	AT&T Labs- Research	SVM HeaderParse 0.2
AUTHOR ADDR	108 Park Avenue; Florham Park, NJ 07932	SVM HeaderParse 0.2
AUTHOR NAME	Michael Rabinovich	SVM HeaderParse 0.1
AUTHOR AFFIL	AT&T Labs- Research	SVM HeaderParse 0.2
AUTHOR ADDR	108 Park Avenue; Florham Park, NJ 07932	SVM HeaderParse 0.2
ABSTRACT	Use of Internet caches is a cheap and effective way to improve performance for all Internet users. Distributed caches offer the potential to serve larger user communities and to deliver higher hit ratios on shared Web documents. The key to building effective distributed caches is a directory structure that allows individual caching servers to locate objects cached at neighboring sites, combining them into a logically unified collective cache. This paper uses Web traces to evaluate a range of alternatives for managing directories in distributed Internet caches. We use trace-driven executions and simulations of prototype caches to compare multicastbased queries of local maps (Harvest) with unicast queries of a global map (CRISP). We then use properties of the traces to predict performance of CRISP variants in which the global map is partitioned or replicated. Finally, we propose a novel lazy CRISP structure based on weakly consistent replication of the most valuable subset of the global ...	user correction - Legacy Corrections
YEAR	1997	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
TECH	Technical Report CS-1997-18	INFERENCE
CITATIONS	20 found	ParsCit 1.0