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
Algorithms for Assigning Substrate Network Resources to Virtual Network Components
Zhu Yong,Mostafa H. Ammar +1 more
TL;DR: This paper develops a basic scheme as a building block for all other advanced algorithms of the VN assignment problem and develops a selective VN reconfiguration scheme that prioritizes the reconfigurations of the most critical VNs.
Proceedings ArticleDOI
Probabilistic in-network caching for information-centric networks
TL;DR: The results show reduction of up to 20% in server hits, and up to 10% in the number of hops required to hit cached contents, but, most importantly, reduction of cache-evictions by an order of magnitude in comparison to universal caching.
Journal ArticleDOI
Object replication strategies in content distribution networks
TL;DR: This paper forms a model for studying the benefits of cooperation between nodes, which provides insight into peer-to-peer content distribution and shows that the problem of optimally replicating objects in CDN servers is NP complete.
Journal ArticleDOI
On network-aware clustering of Web clients
TL;DR: A grouping of clients that are close together topologically and likely to be under common administrative control are introduced, using a ``network-aware" method, based on information available from BGP routing table snapshots.
Book ChapterDOI
Cache less for more in information-centric networks
TL;DR: A centrality-based caching algorithm is proposed by exploiting the concept of (ego network) betweenness centrality to improve the caching gain and eliminate the uncertainty in the performance of the simplistic random caching strategy.
References
More filters
Journal ArticleDOI
Summary cache: a scalable wide-area web cache sharing protocol
TL;DR: This paper demonstrates the benefits of cache sharing, measures the overhead of the existing protocols, and proposes a new protocol called "summary cache", which reduces the number of intercache protocol messages, reduces the bandwidth consumption, and eliminates 30% to 95% of the protocol CPU overhead, all while maintaining almost the same cache hit ratios as ICP.
Journal ArticleDOI
An Algorithmic Approach to Network Location Problems. II: The p-Medians
O. Kariv,S. L. Hakimi +1 more
TL;DR: An algorithm is presented which finds a p-median of a tree (for $p > 1$) in time $O(n^2 \cdot p^2 )$.
Proceedings Article
Hypertext Transfer Protocol -- HTTP/1.0
TL;DR: It is a generic, stateless, object-oriented protocol which can be used for many tasks, such as name servers and distributed object management systems, through extension of its request methods (commands).
ReportDOI
A hierarchical internet object cache
TL;DR: The design and performance of a hierarchical proxy-cache designed to make Internet information systems scale better are discussed, and performance measurements indicate that hierarchy does not measurably increase access latency.
Journal ArticleDOI
End-to-end routing behavior in the Internet
TL;DR: It is found that Internet paths are heavily dominated by a single prevalent route, but that the time periods over which routes persist show wide variation, ranging from seconds up to days.