Distributed Caching Algorithms for Content Distribution Networks

  title={Distributed Caching Algorithms for Content Distribution Networks},
  author={Sem C. Borst and Varun Gupta and Anwar Elwalid},
  journal={2010 Proceedings IEEE INFOCOM},
The delivery of video content is expected to gain huge momentum, fueled by the popularity of user-generated clips, growth of VoD libraries, and wide-spread deployment of IPTV services with features such as CatchUp/PauseLive TV and NPVR capabilities. The `time-shifted' nature of these personalized applications defies the broadcast paradigm underlying conventional TV networks, and increases the overall bandwidth demands by orders of magnitude. Caching strategies provide an effective mechanism for… 

Figures from this paper

Dynamic Cache Management In Content Delivery Networks
On the Complexity of Optimal Content Placement in Hierarchical Caching Networks
This paper study's goal is to reduce the server load by serving as many requests as possible by the caches in multiple-level hierarchical caching networks, and develops an algorithm achieving a provably better approximation ratio than the best-known counterparts.
An Intelligent Satellite Multicast and Caching Overlay for CDNs to Improve Performance in Video Applications
Through simulations of two CDN case studies Cellular and Video on Demand, it is found that multicasting can provide significant reductions in required network bandwidth as compared to terrestrial-based unicast, and it is shown that the multicast solution scales well, both with increasing cache storage and coverage area.
Optimal cooperative content placement algorithms in hierarchical cache topologies
This paper makes the simplifying assumption that the size of each object is equal to one, and shows that certain instances of the content placement problem are of polynomial complexity, while providing an algorithm for their solution.
Optimization of Content Caching in Content-Centric Network
This work investigates models and algorithms for addressing the optimal routing and caching optimization problems and compares the solutions produced with the optimal solution under various assumptions, and contributes to an analysis of the caching investment under the competition among multiple interconnected ISPs.
Collaborative hierarchical caching with dynamic request routing for massive content distribution
This paper proposes an efficient collaborative caching mechanism based on the topology derived from a real-world IPTV system, with a particular focus on exploring the capacity of the existing system infrastructure.
On the design of efficient caching systems
This thesis addresses the problem of designing scalable and cost-effective distributed caching systems that will be able to efficiently support the expected massive growth of content traffic and makes three distinct contributions, including an extensive theoretical characterisation of sharding.
Performance analysis of in-network caching for content-centric networking
Flexible Caching Algorithms for Video Content Distribution Networks
This work designs multiple algorithms for content caching on the servers of global video CDNs: a LRU-based baseline to address the requirements; a flexible ingress-efficient algorithm; an offline cache aware of future requests (greedy); an optimal offline cache (for limited scales); and an adaptive ingress control algorithm for reducing the server’s peak upstream traffic.
Design and Evaluation of the Optimal Cache Allocation for Content-Centric Networking
This work focuses on the cache allocation problem, namely, how to distribute the cache capacity across routers under a constrained total storage budget for the network and proposes a suboptimal heuristic method based on node centrality, which is more practical in dynamic networks with frequent content publishing.


Self-organizing algorithms for cache cooperation in content distribution networks
This paper develops lightweight cooperative cache management algorithms aimed at maximizing the traffic volume served from cache and minimizing the bandwidth cost and establishes that the proposed algorithms are guaranteed to operate within a constant factor from the globally optimal performance, with benign worst-case ratios, even in asymmetric scenarios.
Object replication strategies in content distribution networks
Large-scale cooperative caching and application-level multicast in multimedia content delivery networks
  • J. Ni, D. Tsang
  • Computer Science, Business
    IEEE Communications Magazine
  • 2005
This article introduces the ideas and approaches of implementing cooperative caching and application-level multicast under a hierarchical architecture to achieve large-scale multimedia content delivery.
Placement Algorithms for Hierarchical Cooperative Caching
The main result is a simple constant-factor approximation algorithm for the hierarchical placement problem that admits an efficient distributed implementation and does not appear to be practical for large problem sizes.
Summary cache: a scalable wide-area web cache sharing protocol
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.
Hint-based cooperative caching
Simulations show that the block access times of the hint-based cooperative caching system are as good as those of the existing algorithms, while reducing manager load, block lookup traffic, and replacement traffic by more than a factor of seven.
Analysis and design of hierarchical Web caching systems
  • Hao Che, Zhijun Wang, Ye Tung
  • Computer Science
    Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
  • 2001
An analytical modeling technique is developed to characterize an uncooperative two-level hierarchical caching system where the least recently used (LRU) algorithm is locally run at each cache, and a cooperative hierarchical Web caching architecture is proposed based on these principles.
Cooperative caching: using remote client memory to improve file system performance
It is concluded that cooperative caching can significantly improve file system read response time and that relatively simple cooperative caching algorithms are sufficient to realize most of the potential performance gain.
Approximation algorithms for data placement in arbitrary networks
This work considers a network of nodes with individual storage capacities and a metric communication cost function, in which each node periodically issues a request for an object drawn from a collection of uniform-length objects, and develops a polynomial-time constant-factor approximation algorithm for this placement problem.
Replication Algorithms in a Remote Caching Architecture
Performance of the distributed algorithms is found to be close to optimal, while that of the greedy algorithms is far from optimal.