DocumentCode
1912079
Title
Breadcrumbs: Efficient, Best-Effort Content Location in Cache Networks
Author
Rosensweig, Elisha J. ; Kurose, Jim
Author_Institution
Dept. of Comput. Sci., Univ. of Massachusetts, Amherst, MA
fYear
2009
fDate
19-25 April 2009
Firstpage
2631
Lastpage
2635
Abstract
For several years, web caching has been used to meet the ever-increasing Web access loads. A fundamental capability of all such systems is that of inter-cache coordination, which can be divided into two main types: explicit and implicit coordination. While the former allows for greater control over resource allocation, the latter does not suffer from the additional communication overhead needed for coordination. In this paper, we consider a network in which each router has a local cache that caches files passing through it. By additionally storing minimal information regarding caching history, we develop a simple content caching, location, and routing systems that adopts an implicit, transparent, and best-effort approach towards caching. Though only best effort, the policy outperforms classic policies that allow explicit coordination between caches.
Keywords
Internet; cache storage; resource allocation; telecommunication network routing; Web access loads; Web caching; breadcrumbs; cache networks; caching history; content location; inter-cache coordination; resource allocation; routing systems; Communication system control; Communications Society; Computer science; Content based retrieval; Costs; History; Protocols; Resource management; Routing; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM 2009, IEEE
Conference_Location
Rio de Janeiro
ISSN
0743-166X
Print_ISBN
978-1-4244-3512-8
Electronic_ISBN
0743-166X
Type
conf
DOI
10.1109/INFCOM.2009.5062201
Filename
5062201
Link To Document