Reducing Content Discovery Delay in Named Data Networks

Abstract

Named Data Networking (NDN), despite having vast potential to be communication architecture for future networks, is still facing many crucial questions to answer. We have conducted a mathematical study of the system performance based on an asymmetric tree model in order to reduce content delivery delay. Forwarding strategy is one of the most important layers in NDN architecture and we present a new forwarding strategy named “Reduce Delay” in this work. We have included a Boolean variable IB (IFF boundary) to the default Interest packet. The value is False by default and is set to True once an Interest packet crosses the boundary and the nodes immediate outside (adjacent) the boundary stores a value against the Interest. Once the Interest packet hits the content sources, Data packet is replied back to the requester of the content if the source of the Data is inside the boundary. However, if the source is outside the boundary Data packet travels up to the adjacent nodes only from where an Offer packet is sent to the requester. This strategy saves the discovery time a lot more than the existing scheme as it stores or brings the Data closer to the requester. We have performed mathematical model based analysis and case studies to show the performance of our scheme in compared to the default and existing schemes.