Optimal Cache Allocation for Named Data Caching under Network-Wide Capacity Constraint

TL;DR

This paper proposes a distributed algorithm for optimal cache size allocation in Named Data Networking, maximizing caching gain under a network-wide capacity constraint, especially suited for cloud-based ICN environments.

Contribution

It introduces a novel distributed algorithm for optimal cache allocation in ICN with a global capacity constraint, outperforming existing methods.

Findings

Algorithm achieves near-optimal cache allocation.

Significant performance improvements over existing algorithms.

Effective in diverse network topologies.

Abstract

Network cache allocation and management are important aspects of the design of an Information-Centric Network (ICN), such as one based on Named Data Networking (NDN). We address the problem of optimal cache size allocation and content placement in an ICN in order to maximize the caching gain resulting from routing cost savings. While prior art assumes a given cache size at each network node and focuses on content placement, we study the problem when a global, network-wide cache storage budget is given and we solve for the optimal per-node cache allocation. This problem arises in cloud-based network settings where each network node is virtualized and housed within a cloud data center node with associated dynamic storage resources acquired from the cloud node as needed. With the offline centralized version of the optimal cache allocation problem being NP-hard, we develop a distributed adaptive algorithm that provides an approximate solution within a constant factor from the optimal. Performance evaluation of the algorithm is carried out through extensive simulations involving a variety of network topologies, establishing experimentally that our proposal significantly outperforms existing cache allocation algorithms.