Journal ArticleDOI
The cache location problem
TLDR
There is a surprising consistency over time in the relative amount of web traffic from the server along a path, lending a stability to the TERC location solution and these techniques can be used by network providers to reduce traffic load in their network.Abstract:
This paper studies the problem of where to place network caches. Emphasis is given to caches that are transparent to the clients since they are easier to manage and they require no cooperation from the clients. Our goal is to minimize the overall flow or the average delay by placing a given number of caches in the network. We formulate these location problems both for general caches and for transparent en-route caches (TERCs), and identify that, in general, they are intractable. We give optimal algorithms for line and ring networks, and present closed form formulae for some special cases. We also present a computationally efficient dynamic programming algorithm for the single server case. This last case is of particular practical interest. It models a network that wishes to minimize the average access delay for a single web server. We experimentally study the effects of our algorithm using real web server data. We observe that a small number of TERCs are sufficient to reduce the network traffic significantly. Furthermore, there is a surprising consistency over time in the relative amount of web traffic from the server along a path, lending a stability to our TERC location solution. Our techniques can be used by network providers to reduce traffic load in their network.read more
Citations
More filters
Posted Content
Modeling the Location Selection of Mirror Servers in Content Delivery Networks
TL;DR: This work model, simulate, and optimize the properties of a content delivery network, considering the server locations in a network infrastructure with prioritized customers and weighted connections and shows a significant improvement.
Book ChapterDOI
Efficient Node Bootstrapping for Decentralised Shared-Nothing Key-Value Stores
Han Li,Srikumar Venugopal +1 more
TL;DR: A middleware layer is designed that provides a decentralised scheme of auto-sharding with a two-phase bootstrapping that reduces bootstrap time and improves load-balancing thereby increasing scalability of the KVS.
Proceedings ArticleDOI
Heuristic Algorithms for Replication Transition Problem in the Grid Systems
TL;DR: There exists a polynomial time algorithm that provides optimal solution for the RTP problem when forwarding is not allowed and the communication links are uniform, and the experimental results indicate that the proposed heuristics are very effective.
Dissemination of dynamic multimedia content in networked virtual environments
TL;DR: A distributed server infrastructure is developed for distribution of dynamic multimedia objects in a Networked Virtual Environment based on a distributed proxy architecture and a mathematical model for optimal establishment of proxy servers, assignment of clients to proxies, and replication pattern of objects among the proxies is produced.
Proceedings ArticleDOI
Resource deployment based on autonomous system clustering
J. Gast,Paul Barford +1 more
TL;DR: This work improves the accuracy of an AS forest as a predictor of packet paths, and applies the annotated AS forest to a problem in resource placement to show that the representation is amenable to computationally inexpensive analysis.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
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.
Proceedings Article
Hypertext Transfer Protocol -- HTTP/1.1
Roy T. Fielding,James Gettys,Jeffrey C. Mogul,H. Frystyk,Larry Masinter,Paul J. Leach,Tim Berners-Lee +6 more
TL;DR: The Hypertext Transfer Protocol is an application-level protocol for distributed, collaborative, hypermedia information systems, which can be used for many tasks beyond its use for hypertext through extension of its request methods, error codes and headers.
Proceedings ArticleDOI
Web caching and Zipf-like distributions: evidence and implications
TL;DR: This paper investigates the page request distribution seen by Web proxy caches using traces from a variety of sources and considers a simple model where the Web accesses are independent and the reference probability of the documents follows a Zipf-like distribution, suggesting that the various observed properties of hit-ratios and temporal locality are indeed inherent to Web accesse observed by proxies.