Routing Scalability in Named Data Networking
S Deepa, S Nivetha, Thulasi Lakshmi K, G. S. R. Emil Selvan, Mahalingam Ramkumar · 2022
Named Data network consists of three data structures for forwarding the incoming Interest packets. Whenever the interest packet arrives, it has to search in the pending interest table and the content store. When a large amount of interest packet arrives, the time required to search the matching content in the pending Interest table can be increased. And also, as the size of Content Store is limited, it will be difficult to satisfy the incoming interest packets’ needs. So the interest packets in the content store have to be replaced. In this paper, Optimal Content Store with tree based approach is proposed and is compared with Optimal Content Store without tree based approach. The comparison shows that packet drop rate and delay is comparatively reduced in Optimal Content store with tree based approach.