Transparent en-route cache location for regular networks

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 connguration 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 signiicant saving achieved by using TERCs, and the importance of placing the caches in the optimal locations.

[1]  S. L. HAKIMIt.  AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .

[2]  Richard S. Hall,et al.  A case for caching file objects inside internetworks , 1993, SIGCOMM '93.

[3]  Anja Feldmann,et al.  Rate of Change and other Metrics: a Live Study of the World Wide Web , 1997, USENIX Symposium on Internet Technologies and Systems.

[4]  Jacob R. Lorch,et al.  Making World Wide Web Caching Servers Cooperate , 1996, World Wide Web J..

[5]  Edward A. Fox,et al.  Removal policies in network caches for World-Wide Web documents , 1996, SIGCOMM '96.

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  G.J. Minden,et al.  A survey of active network research , 1997, IEEE Communications Magazine.

[8]  V. Jacobson,et al.  Adaptive Web Caching , 1997 .

[9]  Azer Bestavros,et al.  Speculative data dissemination and service to reduce server load, network traffic and service time in distributed information systems , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[10]  San-qi Li,et al.  A study of slot reuse in dual bus multiple access networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[11]  Syam Gadde,et al.  Reduce, reuse, recycle: an approach to building large Internet caches , 1997, Proceedings. The Sixth Workshop on Hot Topics in Operating Systems (Cat. No.97TB100133).

[12]  Peter B. Danzig,et al.  A Hierarchical Internet Object Cache , 1996, USENIX ATC.

[13]  Dawson R. Engler,et al.  DPF: Fast, Flexible Message Demultiplexing Using Dynamic Code Generation , 1996, SIGCOMM.

[14]  Arie Tamir,et al.  An O(pn2) algorithm for the p-median and related problems on tree graphs , 1996, Oper. Res. Lett..

[15]  Azer Bestavros,et al.  Demand-based document dissemination to reduce traffic and balance load in distributed information systems , 1995, Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing.

[16]  S. Hadjiefthymiades,et al.  Hypertext Transfer Protocol (HTTP) , 1996 .

[17]  P. Krishnan,et al.  Utility of Co-Operating Web Proxy Caches , 1998, Comput. Networks.

[18]  Abdelsalam Heddaya,et al.  WebWave: globally load balanced fully distributed caching of hot published documents , 1997, Proceedings of 17th International Conference on Distributed Computing Systems.