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 of the Sixth International Workshop on Web Caching and Content Distribution
Ronald Doyle,Jeffrey Chase,Syam Gadde,Amin Vahdat,Michael Rabinovich,Sandeep Sibal,Oliver Spatscheck,Walter Sturm,Mark Nottingham,Jussi Kangasharju,James Roberts,Keith W. Ross,Pavlin Radoslavov,Ramesh Govindan,Deborah Estrin,Zongming Fei,Wei-Ying Ma,Bo Shen,Jack Brassil,Andre Beck,Markus Hofmann,Oscar Ardaiz,Felix Freitag,Leandro Navarro,Amy Hughes,Joseph Touch,Vsevolod Panteleenko,Vincent Freeh,Stanislav Rost,John Byers,Azer Bestavros,Arup Acharya,Anees Shaikh,Renu Tewari,Dinesh Verma,Edward G. Coffman,Predrag R. Jelenković,Petar Momčilović,Arun Venkataramani,Praveen Yalagandula,Ravi Kokku,Sadia Sarif,Mike Dahlin,Brian Davison,Terence Kelly,Johnson Lee,William Miniscalco,Meng Li,W. David Shambroom,John Buford,Virgilio Almeida,Daniel A. Menascé,Rudolf H. Riedi,Flávia Peligrinelli,R. Fonseca,Wagner Meira,Richard Liston,Ellen Zegura,Mimika Koletsou,Geoffrey Voelker,Serge Krashakov,Lev Shchur,Sung-Ju Lee,Olivier Verscheure,Chitra Venkatramani,Pascal Frossard,Lisa Amini +66 more
TL;DR: It is found that topologyinformed replica placement methods can achieve average client latencies which are within a factor of 1.1{1.2 of the greedy algorithm, but only if the placement method is designed carefully.
Proceedings ArticleDOI
Prediction f based models for evaluating backfilling scheduling policies
TL;DR: A set of f-model based prediction models are described and evaluated that characterize the behavior that prediction techniques have shown in HPC centers and have been designed for evaluate scheduling policies that use predictions rather than user estimates.
Journal ArticleDOI
An optimal solution for caching multimedia objects in transcoding proxies
TL;DR: A novel model, which is formulated as an optimization problem by combining both transcoding cost and transmission cost in a cooperative way, is presented and an optimal solution is derived for computing the optimal locations for placing a fixed number of versions of the same multimedia object in a network.
Journal ArticleDOI
Hierarchical Reliable Multicast: Performance Analysis and Optimal Placement of Proxies
TL;DR: In this article, the authors studied the use of multicast together with proxy nodes for reliably disseminating data from a single source to a large number of receivers and developed dynamic programming algorithms that give a placement of a fixed number of proxies on an arbitrary tree that minimizes the bandwidth used for reliable transfer.
Proceedings ArticleDOI
Optimized content caching and request capture in CNF networks
TL;DR: The results show the Sequential Reassignment algorithm significantly reduces the average content retrieval latency by as high as 70% and the performance of the derived optimal solutions against the integrated caching and routing heuristics are compared.
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.