Optimal Proactive Caching Placement for Named Data Networking with Interest Aggregation

On-path caching is a building block in Named Data Networking that helps eliminate redundant traffic. The performance of redundancy elimination depends on both Content Store (CS) and Pending Interest Table (PIT), i.e., CS caches content for future reuse, and PIT aggregates repetitive requests in a short period. However, contemporary proactive caching strategies only take account of CS while neglecting PIT. In this work, we integrate both PIT and CS into the proactive caching model, derive how to calculate aggregated request rate, and propose an algorithm to calculate the aggregated request rate across the tree topology. Then we formulate caching placement into optimization problems and solve them with a decomposition-based evolutionary algorithm. The simulation results show that the proposed scheme outperforms conventional solutions.