Web cache location
Brian Boffey,Pirooz Saeidi +1 more
TL;DR: This paper concentrates on the locational aspects of Web caching giving both an overview, from an operational research point of view, of existing research and putting forward avenues for possible further research.
read more
Abstract: Stress placed on network infrastructure by the popularity of the World Wide Web may be partially relieved by keeping multiple copies of Web documents at geographically dispersed locations. In particular, use of proxy caches and replication provide a means of storing information 'nearer to end users'. This paper concentrates on the locational aspects of Web caching giving both an overview, from an operational research point of view, of existing research and putting forward avenues for possible further research. This area of research is in its infancy and the emphasis will be on themes and trends rather than on algorithm construction. Finally, Web caching problems are briefly related to referral systems more generally.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Discrete location theory
TL;DR: In this article, the authors propose a method for solving the p-center problem on trees and demonstrate the duality of covering and constraining p-Center problems on trees.
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
An O(pn2) algorithm for the p -median and related problems on tree graphs
TL;DR: This work improves the complexity bound of the p-median problem on trees by showing that the total running time of the ''leaves to root'' dynamic programming algorithm is O(pn^2).
263
Related Papers (5)
Yongpyo Lee,Jinho Oh,Sangyong Han +2 more
- 01 Jan 2005
Allan Robert Staker,Heather Clayton Staker +1 more
- 13 Feb 2015
Antonia Erni,Moira C. Norrie,Adrian Kobler +2 more
- 15 Jul 1998