Download:
|
by P. Krishnan, Danny Raz, Yuval Shavitt
http://www.wavelet.org/who/shavitt/pub/line.ps
Add To MetaCart
Abstract:
Abstract. Caching improves network and system performance for WWW browsing. The way caches are currently deployed requires clients or caches to be aware of the location of nearby caches. This creates management and configuration problems, which may also lead to performance bottlenecks. In contrast, Transparent en-route caches (TERC) are devices that are placed at appropriate locations within the network and work obliviously. A TERC snaps web requests and web data. If the requested item exists in the TERC's memory, the data is sent to the requester, otherwise the request is transparently forwarded up the routing path. In this work, we study the important problem of where to place network caches, and in particular, TERCs. This problem is intractable for general networks, and thus we concentrate on regular topologies namely lines and rings. We give both a general dynamic programming algorithm, and closed formulas for some special cases. Our results demonstrate both the significant saving achieved by using TERCs, and the importance of placing the caches in the optimal locations. 1.
Citations
|
7709
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
202
|
Hypertext transfer protocol (HTTP/1.0). Working Group of the Internet Engineering Task Force
– Berners-Lee
- 1995
|
|
188
|
Rate of change and other metrics: A live study of the World Wide Web
– Douglis, Feldmann, et al.
- 1997
|
|
146
|
An algorithmic approach to network location problems, part ii: p-medians
– Kariv, Hakimi
- 1979
|
|
113
|
DPF: fast, flexible message demultiplexing using dynamic code generation
– Engler, Kaashoek
- 1996
|
|
104
|
Speculative data dissemination and service to reduce server load, network traffic and service time for distributed information systems
– Bestavros
- 1996
|
|
84
|
A Case for Caching File Objects Inside Internetworks
– Danzig, Hall, et al.
- 1993
|
|
83
|
Adaptive Web caching
– Zhang, Floyd, et al.
- 1997
|
|
72
|
Making world wide web caching servers cooperate
– Malpani, Lorch, et al.
- 1995
|
|
62
|
Reduce, reuse, recycle: An approach to building large Internet caches
– Gadde, Rabinovich, et al.
- 1997
|
|
55
|
Demand-based document dissemination to reduce tra c and balance load in distributed information systems
– Bestavros
- 1995
|
|
22
|
An O(pn ) algorithm for the p-median and related problems on tree graphs
– Tamir
- 1996
|
|
8
|
A study of slot reuse in dual bus multiple access networks
– Garrett, Li
- 1991
|
|
7
|
and Binay Sugla. Utility of cooperating Web proxy caches
– Krishnan
- 1997
|
|
6
|
A case for caching objects inside internetworks
– Danzig, Hall, et al.
- 1993
|
|
4
|
Multicuts in unweighted graphs with bounded degree and bounded tree-width
– Calinescu, Fernandes, et al.
- 1998
|
|
3
|
DPF: fast, message demultiplexing using dynamic code generation
– Engler, Kaashoek
- 1996
|
|
2
|
Why internet service providers should integrate web caches into their networks
– Melve
- 1996
|
|
2
|
Web Caching Workshop
– NLANR
|
|
1
|
Sunil Shende, and Rahul Simha. Ecient algorithms for erasure node placement on DQDB networks
– Narahari
- 1995
|
|
1
|
usenix symposium on internet technologies and systems
– Williams, Abrams, et al.
- 1997
|
|
1
|
Sunil Shende, and Rahul Simha. Efficient algorithms for erasure node placement on DQDB networks
– Narahari
- 1995
|
