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
Proceedings ArticleDOI
A performance comparison between parallel and lazy fetching in vertically distributed cloud databases
Jens Kohler,Thomas Specht +1 more
TL;DR: This work proposes the introduction of a data cache architecture and two corresponding fetch procedures, i.e. lazy and parallel fetching, and shows that the parallel fetch strategy by far outperforms the lazy fetch strategy.
Book ChapterDOI
Optimal Content Distribution and Multi-resource Allocation in Software Defined Virtual CDNs
TL;DR: This work forms the joint content-resource allocation problem for the design of SDvCDNs, as a minimum cost mixed-cast flow problem with resource activation decisions, and optimizes the placement and routing of content objects along with the allocation of the required virtual storage, compute, and transport resources.
On the analysis and management of cache networks
TL;DR: The next generation of decision-makers will have to consider not only the needs of their employees but also the environment in which they work, which will have an important impact on their decision-making.
Journal ArticleDOI
Virtual Network Mapping Model and Optimization Algorithms: Virtual Network Mapping Model and Optimization Algorithms
TL;DR: The model of virtual network mapping, the methods and algorithms for mapping virtual nodes and virtual links, and some open issues are presented to be further studied in the virtual network-mapping field.
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.