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
Scalable download protocols
TL;DR: This thesis shows that there are significant performance advantages in using current system state information (rather than only proximities and average loads) and in deferring selection decisions when possible and proposes adaptations of already proposed peer-assisted download techniques to support a streaming service, enabling playback to begin well before the entire media file is received.
Book ChapterDOI
A greedy algorithm for capacity-constrained surrogate placement in CDNs
TL;DR: Simulation results show that the greedy algorithm is far better than the existing optimal placement scheme that makes decisions based solely on network traffic, and suggests that capacity constraints on surrogates or server bottlenecks should be considered when determining surrogate placement, especially when the capacities of CDN servers are limited.
Journal ArticleDOI
Load-balanced agent activation for value-added network services
TL;DR: The goal is to develop a mechanism to activate value-added service agents in the network for the purpose of reaching a balance between the performance and overhead, and develop a polynomial time algorithm to solve the LBAAP problem in single tree case and propose a heuristic.
Journal ArticleDOI
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.
Book ChapterDOI
Subscription-enhanced content delivery
TL;DR: This work proposes two approaches to content delivery that exploit both proactive push-time placement and passive access-time replacement based on the subscription information, the access pattern of subscribers, and that of non-subscribers.
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.