CAPIC: Cache based on Popularity and Class in Named Data Network

Abstract

In the IP network, if there are many consumers who want the same data, the request and response process for data will be repeated and will increase the overall network load. Modifications have been made to IP networks, namely by Content Distribution Network which places a duplicate server in a place closer to the consumer. CDN managed to reduce network load but cannot accommodate changes in dynamic consumer requests. A new network paradigm was proposed. The network paradigm that was originally host-centric turned into content-centric. This scheme is known as the Named Data Network (NDN). NDN causes data communication to be carried out efficiently and minimizes network load. Content store as an important component of NDN routers is a limited resource. For this reason, certain mechanisms are needed to optimize content store usage. As far as the author's knowledge there are no papers that discuss caching mechanisms that pay attention to popularity and at the same time also differentiate service classes. In fact, there is a variation of traffic related to the traffic requirement. That's why it is necessary to differentiate service class treatment in NDN content store and also consider the content popularity. This paper proposed a caching algorithm namely CAPIC (CAche based on PopularIty and Class). From the simulation, concludes that CAPIC gives the greater hit rate compared to another scheme that only considers popularity and the better path stretch and appropriates with the cache proportion based on class.