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
MMC01-4: Algorithms for Server Placement in Multiple-Description-Based Media Streaming
Satyajeet Ahuja,Marwan Krunz +1 more
TL;DR: A mixed-integer linear programming (MILP) formulation and an efficient heuristic solution for the server placement (SP) problem are proposed and it is shown that the SP problem belongs to the class of NP-complete problems.
Proceedings ArticleDOI
Tornadoes In The Cloud: Worst-Case Attacks on Distributed Resources Systems
Jhonatan Tavori,Hanoch Levy +1 more
TL;DR: In this article, the authors characterize and analyze damage-maximization strategies for a number of attacks including deterministic attack, concur-rent stochastic agents attack, approximation of a virus-spread attack and over-size binomial attack.
Proceedings ArticleDOI
Efficient Caching for Delivery of Multimedia Information with Low Latency in ICN
Kamrul Hasan,Seong-Ho Jeong +1 more
TL;DR: This paper provides a solution to the on-path and hash caching problems using the cluster-based ICN to increase the probability of content access and decrease the packet loss ratio.
Journal Article
Virtual video caching: a scalable and generic technique for improved quality of video service
TL;DR: This paper proposes a new scheme for scalable video services across the Internet and introduces the notion of blackouts, which is used to provide video viewing with low values for average blackout frequency and blackout lengths and gets much better performance than what ordinary video caching offers.
Proceedings ArticleDOI
Optimal replication transition strategy in distributed hierarchical systems
TL;DR: This work is the first that proposes an optimal algorithm for the replication transition problem on tree topology, which is one of the most important models in data grid systems and Web proxy systems from the literature.
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.