On the steady-state of cache networks

@article{Rosensweig2013OnTS,
  title={On the steady-state of cache networks},
  author={Elisha J. Rosensweig and Daniel Sadoc Menasch{\'e} and James F. Kurose},
  journal={2013 Proceedings IEEE INFOCOM},
  year={2013},
  pages={863-871}
}
Over the past few years Content-Centric Networking, a networking model in which host-to-content communication protocols are introduced, has been gaining much attention. A central component of such an architecture is a large-scale interconnected caching system. To date, the way these Cache Networks operate and perform is still poorly understood. In this work, we demonstrate that certain cache networks are non-ergodic in that their steady-state characterization depends on the initial state of the… 

Figures and Tables from this paper

ModelGraft: Accurate, Scalable, and Flexible Performance Evaluation of General Cache Networks
TLDR
This work proposes a new technique for the performance evaluation of large-scale caching systems that intelligently integrates elements of stochastic analysis within a MonteCarlo simulative approach, that they colloquially refer to as ModelGraft.
A Cache Management Scheme for Efficient Content Eviction and Replication in Cache Networks
TLDR
The CLCE replication scheme reduces the redundant caching of contents; hence improves the cache space utilization and LFRU approximates the least frequently used scheme coupled with the least recently used scheme and is practically implementable for rapidly changing cache networks like ICNs.
Optimal Caching and Routing in Hybrid Networks
TLDR
A simple distributed algorithm for the joint routing/caching problem is developed and demonstrated its efficacy via simulation and it is demonstrated that under the assumption of stationary, independent requests, it is optimal to adopt static caching based on content popularity.
A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints
TLDR
This work considers caching in cellular networks in which each base station is equipped with a cache that can store a limited number of files and provides two extensions of the basic algorithm based on stochastic and deterministic simulated annealing which find the global optimum.
A Comparison of Caching Strategies for Content Centric Networking
TLDR
This paper compares the performances of CCN caching strategies within the same simulation environment and compares via simulation five relevant caching strategies: Leave Copy Everywhere (LCE), Leave Copy Down (LCD), ProbCache, Cache "Less" For More and MAGIC.
Enhancing wireless networks with caching: Asymptotic laws, sustainability & trade-offs
On the complexity of optimal routing and content caching in heterogeneous networks
TLDR
This work investigates the problem of optimal request routing and content caching in a heterogeneous network supporting in-network content caching with the goal of minimizing average content access delay, and proves that under the congestion-insensitive model the problem can be solved optimally in polynomial time.
A hybrid methodology for the performance evaluation of Internet-scale cache networks
Steady Status Study of Distributed Data Caching in Ad Hoc Networks
TLDR
It is empirically shown that to minimize the average access cost (or average search cost) in the network, the optimal number of replica of each data object is proportional to the square root of the data's access frequency.
Towards Popularity-Based Caching in Content Centric Networks
TLDR
An important feature for CCN is to manage the cache of nodes by defining replacement policy, cache policy and cache strategy, and a new caching strategy based on popularity is proposed.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 41 REFERENCES
Modelling and Evaluation of CCN-Caching Trees
TLDR
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.
Approximate Models for General Cache Networks
TLDR
A new algorithm is proposed, termed a-Net, that approximates the behavior of multi-cache networks by leveraging existing approximation algorithms for isolated LRU caches and it is demonstrated the utility of a- net using both per- cache and network-wide performance measures.
Modeling data transfer in content-centric networking
TLDR
An analytical model of CCN in-network storage and receiver-driven transport, that more generally applies to a class of content ori ented networks identified by chunk-based communication, is developed.
Breadcrumbs: Efficient, Best-Effort Content Location in Cache Networks
TLDR
This paper considers a network in which each router has a local cache that caches files passing through it and develops a simple content caching, location, and routing systems that adopts an implicit, transparent, and best-effort approach towards caching.
Performance evaluation of the random replacement policy for networks of caches
TLDR
This paper proves that when the popularity distribution follows a general power-law with decay exponent α > 1, the miss probability is asymptotic to O( C1-α) for large cache size C, and evaluates network of caches under RND policy for homogeneous tree networks.
The LCD interconnection of LRU caches and its analysis
A Hybrid Overlay Multicast and Caching Scheme for Information-Centric Networking
TLDR
This paper investigates the potential benefits of MultiCache, an overlay network architecture aiming at handing control back to network operators, and studies crucial aspects of the architecture, paying special attention to the properties of the distributed caching scheme.
Design and management of globally distributed network caches
TLDR
This thesis makes several contributions to the research area of high-performance distributed data access by designing a globally-distributed Internet cache service, called Storage Embedded Networks (SEN), which improves user response times and data service scalability of the Internet by ubiquitous caching.
Proportional Replication in Peer-to-Peer Networks
  • S. Tewari, L. Kleinrock
  • Computer Science
    Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
  • 2006
TLDR
This paper shows that local storage management algorithms like LRU automatically achieve near-proportional replication and that the system performance with the replica distribution achieved by LRU is very close to optimal.
Distributed Caching Algorithms for Content Distribution Networks
TLDR
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.
...
1
2
3
4
5
...