An On-Path Caching Scheme Based on the Expected Number of Copies in Information-Centric Networks

• Main Authors: Yuanhang Li, Jinlin Wang, Rui Han
• Format: Article
• Language: English
• Published: MDPI AG 2020-10-01
• Series: Electronics
• Subjects: ICN; cache allocation; expected number of copies; content placement
• Online Access: https://www.mdpi.com/2079-9292/9/10/1705

The Information-Centric Network (ICN) is one of the most influential future network architectures and in-network caching in ICN brings some helpful features, such as low latency and mobility support. How to allocate cache capacity and place content properly will greatly influence the performance of ICN. This paper focuses on the cache allocation problem and content placement problem under the given cache space budget. Firstly, a lightweight allocation method utilizing information of both topology and content popularity is proposed, to allocate cache space and get the expected number of copies of popular content. The expected number of copies represents the number of content copies placed in the topology. Then, an on-path caching scheme based on the expected number of copies is proposed to handle the content placement problem. In the cache allocation scenario, the lightweight allocation method performs better than other baseline methods. In the content placement scenario, Leave Copy Down (LCD) based on the expected number of copies performs the second-best and is very close to Optimal Content Placement (OCP).