Abstract
To address the problems of low cache hit ratio and high routing hops to obtain content in Named Data Networking (NDN), this paper proposes a Cache placement Policy based on Dynamic Popularity (DPCP). When the requested content arrives at the routing node, the latest popularity is calculated by combining the number of requests in current cycle and the popularity of the previous cycle, and the caching threshold is dynamically adjusted according to the occupancy of caching space, only content with popularity exceeding the current threshold is cached, thereby retaining the content with the highest probability of being requested in future time periods. This cache placement policy is also implemented using Programming Protocol-independent Packet Processors (P4) deployed on programmable data plane. Experimental results show that the proposed algorithm can effectively improve the cache hit ratio and reduce the average routing hops compared with the traditional caching policy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
