• Corpus ID: 11883244

Fair Collaborative In-Network Caching Game and Its Cost Analysis on General Network Topologies

  title={Fair Collaborative In-Network Caching Game and Its Cost Analysis on General Network Topologies},
  author={Liang Wang and Jussi Kangasharju},
Information-centric networking extensively uses universal in-network caching. However, developing an efficient and fair collaborative caching algorithm for selfish caches is still an open question. In addition, the communication overhead induced by collaboration is especially poorly understood in a general network setting such as realistic ISP and Autonomous System networks. In this paper, we address these two problems by modeling the in-network caching problem as a Nash bargaining game. We… 
2 Citations
FairCache: Introducing fairness to ICN caching
This paper develops optimal and heuristic caching solutions that explicitly consider both performance and fairness, and argues that only algorithms that are fair to all parties will encourage engagement and cooperation.
Performance analysis of Content-Centric and Content-Delivery networks with evolving object popularity
Novel optimization models are formulated to analyze the performance gains that CDN and CCN can achieve, by reducing the total amount of traffic exchanged through the network, and discover that, in most of the cases, CDN reduces the overall traffic exchanged between network nodes, leading to better performance, whereas?CCN should instead be preferred in those scenarios where?CDN cannot quickly react to popularity evolution.


Selfish caching in distributed systems: a game-theoretic analysis
The existence of pure strategy Nash equilibria is shown, the price of anarchy is investigated, and the game can always implement the social optimum in the best case by giving servers incentive to replicate.
Effects of Cooperation Policy and Network Topology on Performance of In-Network Caching
This paper shows that there is a tradeoff between two common caching metrics, byte hit rate and footprint reduction, and shows that a cooperation policy can adjust this tradeoff.
Cache-to-Cache: Could ISPs Cooperate to Decrease Peer-to-Peer Content Distribution Costs?
  • G. Dán
  • Computer Science
    IEEE Transactions on Parallel and Distributed Systems
  • 2011
It is found that cooperation can lead to significant improvements of the cache efficiency with little communication overhead even if ISPs follow their selfish interests.
Cooperative caching through routing control in information-centric networks
Information-centric network (ICN), which is one of the prominent Internet re-design architectures, relies on in-network caching for its fundamental operation. However, previous works argue that the
Understanding optimal caching and opportunistic caching at "the edge" of information-centric networks
Caching content opportunistically only near its consumers is shown to outperform the traditional on-path caching approach assumed in most ICN architectures in an unstructured network with arbitrary topology represented as a random geometric graph.
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.
Selfish content replication on graphs
This paper considers replication games played over arbitrary social graphs; the social graph models limited interaction between the players due to, e.g., the network topology, and proposes an efficient distributed algorithm to reach an equilibrium over a non-complete social graph.
Probabilistic in-network caching for information-centric networks
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.
Modelling and Evaluation of CCN-Caching Trees
This paper models the caching part of the proposed networking paradigm in isolation from the rest of the suggested features of Content Centric Networks, and develops a mathematical model for a single router, based on continuous time Markov-chains, which assesses the proportion of time a given piece of content is cached.
Distributed Caching Algorithms for Content Distribution Networks
This paper develops light-weight cooperative cache management algorithms aimed at maximizing the traffic volume served from cache and minimizing the bandwidth cost, and establishes that the performance of the proposed algorithms is guaranteed to be within a constant factor from the globally optimal performance.