Novelty Cache Concept in Named Data Network
| Author(s) | : | C. Bharathipriya, A.Daphnil Madhunita, S.Anusha |
| Institution | : | Student , Dept. of Computer Science and Engineering, Dhanalakshmi College of Engineering |
| Published In | : | Vol. 3, Issue 3 — March 2016 |
| Page No. | : | 577-581 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
Named Data Networking is a new paradigm for future internet here data packet carry name rather than current IPparadigm of endpoints. Thus we provide light weight integrity verification architecture for security in NDN system. Contentbased search is common where the issue of security lie low than expectation. Different Systems are connected in differentnetworks where the information of the system will be stored in the router and the content of the system in its temp memory sothat the data response will be redirected from the router cache itself.The main mechanism of LIVE lies in generating different content integrity status for a single content object, which allows aContent Provider to control content access performed by NDN nodes. Pending Interest Table stores all the Interests that arouter has forwarded but not-satisfied yet. Forwarding Information Base is a routing table which maps name components tointerfaces. The FIB itself is occupied by a name- affix routing protocol, and have multiple output interfaces for each prefix.Content Store is a transient cache of Data packets that the router has accepted. Because data packet of an NDN ismeaningful autonomous of where it comes from or where it is forwarded thus it can be cached to satisfy upcoming Interests.Replacement strategy is traditionally having already been used, but the replacement strategy is determined by the router andmay differ
C. Bharathipriya, A.Daphnil Madhunita, S.Anusha, “Novelty Cache Concept in Named Data Network”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 3, Issue 3, pp. 577-581, March 2016.








