An approximate analysis of the LRU and FIFO buffer replacement schemes
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
Discrete Applied Mathematics
Exact Analysis of Bernoulli Superposition of Streams Into a Least Recently Used Cache
IEEE Transactions on Software Engineering
On realistic network topologies for simulation
MoMeTools '03 Proceedings of the ACM SIGCOMM workshop on Models, methods and tools for reproducible network research
The LCD interconnection of LRU caches and its analysis
Performance Evaluation
A data-oriented (and beyond) network architecture
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Approximate analysis of LRU in the case of short term correlations
Computer Networks: The International Journal of Computer and Telecommunications Networking
Design considerations for a network of information
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Modelling and evaluation of CCN-caching trees
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
Probabilistic in-network caching for information-centric networks
Proceedings of the second edition of the ICN workshop on Information-centric networking
CCN forwarding engine based on Bloom filters
Proceedings of the 7th International Conference on Future Internet Technologies
A versatile and accurate approximation for LRU cache performance
Proceedings of the 24th International Teletraffic Congress
Cache "less for more" in information-centric networks (extended version)
Computer Communications
Evaluating CCN multi-path interest forwarding strategies
Computer Communications
Caching in information centric networking: A survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the performance of bandwidth and storage sharing in information-centric networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance evaluation of the random replacement policy for networks of caches
Performance Evaluation
| Hi-index | 0.00 |
Many systems employ caches to improve performance. While isolated caches have been studied in-depth, multicache systems are not well understood, especially in networks with arbitrary topologies. In order to gain insight into and manage these systems, a low-complexity algorithm for approximating their behavior is required. We propose a new algorithm, termed a-NET, that approximates the behavior of multi-cache networks by leveraging existing approximation algorithms for isolated LRU caches. We demonstrate the utility of a-NET using both per-cache and network-wide performance measures.We also perform factor analysis of the approximation error to identify system parameters that determine the precision of a-NET.