Edge Caching Cooperation in NDN Scenarios for Self-organizing Networks

The paper is devoted to the issues of caching in Named Data Networks (NDN), aimed at addressing content by name and separating information from its producer node. In-network caching is one of the main features of NDN, turning them into a network of interconnected caches capable of accumulating packets in the buffer of intermediate routers, as well as bring them closer to the consumer using caching at the edge of the network. The effectiveness of a content caching system depends on many factors discussed in the paper: the popularity law and content replication strategy, cache size and displacement policies. For information distribution and caching at the edge router, we present an original algorithm that allows efficient caching of popular content. The cooperative caching algorithm outperforms traditional approaches in several metrics (cache hit, latency, etc.). Simulation of the performance of such an algorithm for the scenario of a vehicular self-organizing network was carried out in the ndnSIM network simulator.