On the Optimal Cache Allocation in Information-Centric Networking

Citations Over Time

Abstract

In recent years, Information-Centric Networking (ICN) that mainly focuses on contents that are transmitted and received instead on end hosts that transmit and receive contents has been under the spotlight. In the literature, there have been several studies on contents caching, which is one of the notable features in ICN. Furthermore, in recent years, the solution of the cache allocation problem has been studied with mathematical approaches as well as simulation experiments However, it is not well understood how the optimal cache allocation is affected by several factors such as the network topology and the total cache size. In this paper, by combining our performance analysis of ICN on an arbitrary network topology and conventional heuristic for optimization problems (i.e., generic algorithm), we investigate how the optimal cache allocation to routers is affected by several factors. Furthermore, we validate our experimental findings using a simplified model of an ICN network in the parking-lot configuration.

Related Papers

• → A novel cache mapping scheme for dynamic set-based cache partitioning(2009)4 cited
• → A GA-based low-power Cache Partitioning algorithm for multi-programmed systems(2013)1 cited
• → Reducing cache conflicts by multi-level cache partitioning and array elements mapping(2002)1 cited
• Cache Scheme Based on LRU-like Algorithm(2007)
• → A Self-Tuning Algorithm for Low-Power Cache(2012)