Abstract
Named Data Networking (NDN) aims to improve the efficiency of data delivery for the Internet. One of the typical characteristics of NDN is ubiquitous caching, that is to say, each network participant in NDN is capable of caching contents. This caching feature is beneficial for enhancing the data availability but also raises a problem of cache consistency. In this paper, we propose a novel strategy of cache invalidation, called PIOR (Proactive Invalidation with Optional Renewing), to provide strong consistency for NDN. PIOR is based on a lightweight publish/subscribe model, actively publishing the updated contents to the router nodes to guarantee the copy validity. We also conceive customized publish/subscribe rules to relieve the unbearable burden on the server imposed by the excessive publishing traffic. The advantage of PIOR lies in simple deployment and compatibility, since the invalidation process of PIOR is independent of the inherent process of NDN. We conduct extensive simulations over a real topology to evaluate the achievable performance of PIOR. The simulation results show that PIOR is able to achieve a high hit ratio and low server load at the low cost of network management.
Highlights
In the past decades, the major usage of the Internet has shifted from the information browsing to the content dissemination [1]
SERVER LOAD Considering that the server in PIOR or Reactive Invalidation sends data packets and signaling and the latter is much smaller than the former, we provide two indicators to measure the server load, one is the number of packets sent per second, the other is the number of kilobytes transferred per second
In this work, we propose a proactive cache invalidation strategy, PIOR, to provide strong consistency for Named Data Networking (NDN) based on a lightweight publish/subscribe model
Summary
The major usage of the Internet has shifted from the information browsing to the content dissemination [1]. After a period of time, there is a content updated in the server, which successively sends a data-4 packet according to the previously recorded FaceList field When receiving this data packet, the router will update the outdated content cached before and a publishing process is done. Supposing that User 1 sends an Interest-2 packet to request for content C1 that is eligible to be actively published When this packet reaches the server, the FaceList of it is [251, 252, 251, 251, 251] which will be recorded in the FLT with the name of the content as an entry (C1, [251, 252, 251, 251, 251]) (denoted as Entry-1). Once content C1 is updated at the server, a Data-4 packet is published with initial FaceListBack [251, 252, 251, 251] on Face 251 Receiving this packet, Router 5 caches its copy, the Publication of which is set to 0 in the CS. The data packets of the above publishing process are replaced with Data-5 packets in the cleanup process when content C1 is no longer maintained in the server
Sign-in/Register to view highlights & summary 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.
