Abstract-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.
Reference REF designed a low-complexity algorithm for caching in networks with arbitrary topologies.
Approximate Models for General Cache Networks
2010 Proceedings IEEE INFOCOM
2010 Proceedings IEEE INFOCOM
Computer Science