Cache Management with Extended Interest for Information-centric Networking

In Information-centric Networking (ICN), users can obtain contents from caches in ICN routers. However, how to use caches efficiently is one of challenges. One existing scheme to obtain caches uses a caching algorithm reducing cache overlaps among routers, and users can obtain caches by referring to records that routers have about caches. However, this scheme has two problems. First, routers which forward Interests towards a cache are limited. Second, this scheme depends on information from an ISP on forwarding Interests. In this paper, we propose Cache-aware routing scheme Referring Distance for contents managed by extended Interest for ICN (CaRD), which enables all routers to obtain the closest content without information from an ISP. In CaRD, routers record hop counts to a server and a cache as passing information of contents. Routers compare these hop counts, and then send request packets towards the closest contents. Moreover, caches move by request packets, so a hop count to a cache of record needs updating. For that, CaRD extends request packets. We add two new fields to request packets and change their operation. To confirm effectiveness of CaRD, we implement CaRD on a simulator, ndnSIM, and evaluate cache hit ratio, traffic and download time.