Cooperative Update Mechanism of Cache Update Method Based on Content Update Dynamic Queries for Named Data Networking In Named Data Networking (NDN), a client requests a content object by its content identifier, instead of the serveru0027s IP address. When a router or a node around the client stores the content in the cache, it transfers the content from the cache. As a result, it is possible to provide information quickly and efficiently to many users. In NDN, a content distributor can configure the contentu0027s expiration time at each cache. The expiration time should be long enough to use the cache effectively and decrease the amount of traffic. However, if the expiration time is too long this increases the possibility of receiving old content. A shorter expiration time reduces this possibility but this causes the amount of traffic to increase instead. In order to solve this tradeoff relationship, we proposed an automatic cache update method where each router queries the version number of all content in the cache to automatically remove old content. Since it is too difficult to set an appropriate inquiry interval for all the content, we also proposed a cache update method based on content update dynamic queries to dynamically change the inquiry interval when each content object is not updated. This paper improves this method by introducing a cooperative update mechanism to reduce the amount of traffic in the network and the number of times old content is received. It also evaluates the method on the generated topology that is similar to real topology and shows that, for example, when the cache size on all routers is large enough, although the difference in the average aggregated traffic is larger than that of the authoru0027s first method where the inquiry interval was 270 seconds by 49.1xe2x80x9384.9 GBytes for the experimental period (7 days) ( 4.9xe2x80x938.4 MBytes per minute), the number of inquiries all routers generated is reduced by 131232.6xe2x80x93 1159687.9 times over 7 days ( 13.0xe2x80x93115.0 times per minute).

An adaptive cache management approach in ICN with prefilter queues Abstract   In InformationCentric Networking (ICN), transmission does not depend on the ends of communication, but on the content itself. Innetwork cache plays an important role in ICN, it empowers nodes in ICN better mobility. It also shortens serving path, lightens load of server, reduces traffic and time delay, its efficiency seriously affects performance of entire network, and thus cache management in ICN draws much attention of researchers recently. Although there are a lot approaches have been proposed, a cache management scheme with better adaptability and less cost remains to be studied. To this end, we propose StatevalueandCacherateMethod (SCMethod) to manage cache resources in ICN, which comprises cache deployment policy and cache replacement policy. In cache level, we add prefilter queues in front of cache queue to filter out popular content to store in cache. In the perspective of node, according to factors that nodexe2x80x99s state and relative location on data forwarding path, we define node state and cache rate to select nodes with maximum of state value or minimum cache rate to cache content, and effectively mitigate data redundancy. In order to increase dynamics and adaptive of system for mobility of nodes, we employ cache hit ratio as feedback to dynamically adjust the number of prefilter queues in every node. With prefilter queues, we improve Least Recently Used (LRU) cache replacement method. We conduct extensive experiments in simulator Icarus (Saino et al., 2014 1) with both tree topology and realistic internet topologies, define four metrics to quantitatively evaluate performance of SCMethod and verify its efficacy of reducing latency and load. Simulation results demonstrate that SCMethod we proposed outperform several classic cache schemes of ICN.