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
Book ChapterDOI
An Optimal Method for Coordinated En-route Web Object Caching
TL;DR: This paper considers the object caching problem of determining the optimal number of copies of an object to be placed among en-route caches on the access path from the user to the content server and their locations such that the overall net cost saving is maximized and proposes an object caching model for the case that the network topology is a tree.
Journal ArticleDOI
A new surrogate placement algorithm for cloud-based content delivery networks
TL;DR: A novel algorithm for virtual surrogate placement is developed that combines multiple knapsack and competitive facility location problems and achieves significantly better results in terms of a decreased number of surrogate servers, decreased total path length between end users and surrogate servers and CCDN deployment cost.
Journal ArticleDOI
Cost efficiency of mobile in-network caching
TL;DR: This paper simulates both the SDN‐optimized in‐network caching system and data center caching, the results of which are utilized in the cost model and show that in‐ network caching reduces network‐related CAPEX and OPEX by 0.49% compared with caching only in data centers.
Proceedings ArticleDOI
Optimizing cross traffic with an adaptive CDN replica placement strategy
Moises Rodrigues,Andre Moreira,Marcio Neves,Ernani Azevedo,Djamel Sadok,Arthur Callado,Victor Souza +6 more
TL;DR: A new dynamic RPA strategy, very similar to the Greedy strategy, based on the count of data flows through network nodes is proposed, which seems to place replica servers more efficiently during local flash crowd events.
Book ChapterDOI
Minimizing metadata access latency in wide area networked file systems
TL;DR: It is shown through extensive simulations that even in the WAN setting, access latency over WireFS is comparable to NFS performance in the LAN setting; the migration overhead is also marginal.
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.