In Named Data Networking (NDN), a content can be replicated in multiple network node. Thus, more than one interface can be selected for the same content in a node, and it is very important to choose the interface to forward request packet for better network performance. In this paper, we introduce a MDP-based forwarding strategy which is under the consideration of network problem and location of content. The whole scheme consists of three segments. First, we develop a Markov Decision Process (MDP) model for the whole forwarding process in a single node, and utilize MDP to solve the forwarding decision problem. Second, we build the request output queue based on content and utilize queuing theory to estimate the real-time network status, which is used as immediate reward in MDP. Last, a rate control mechanism is provided to solve the rate issues caused by the fast forwarding of request packet, and it is used to built the stable queue. Numerical experiments within a set of network set are implemented by ndnSIM, and the result of experiments demonstrates a good performance of low delay.

Named Data Networking (NDN) architecture promises significant advantages over current Internet architecture by replacing its host-centric design with a content-centric one. In NDN, the mode that one Interest packet gets one Data packet can quite easily lead to Interest flooding and a huge number of the related entries. Moreover, the absence of predefined connections is a challenge for NDN to efficiently manage the successive requests from consumers or the in-network concurrent flows. In this paper, we describes an adaptive traffic scheduling mechanism where multiple Data packets per Interest packet are allowed without violating the operational principle of original NDN protocol and in-network caching can be collaborated with network coding to achieve multi-path transmission. Evaluation results show that the proposed scheme can significantly improve transmission efficiency and reduce system load including the number of Interest packets and lookup operations performed on the related tables in routers.

Named Data Networking (NDN) architecture promises significant advantages over current Internet architecture by replacing its host-centric design with a content-centric one. In NDN, the mode that one Interest packet gets one Data packet can quite easily lead to Interest flooding and a huge number of the related entries. Moreover, the absence of predefined connections is a challenge for NDN to efficiently manage the successive requests from consumers or the innetwork concurrent requests. In this paper, we argue that it is necessary for NDN to support flow transmission mechanism aimed at improving transmission performance, and based on it we design flow-based NDN (f-NDN) architecture which can not only achieve overload decreasing by packing successive Interest packets but also performance improvement and load-balance by multi-path. Simulation of our architecture is carried out in different network scenarios to evaluate the performance of our architecture. Evaluation results show that the proposed architecture operates better than NDN architecture in many aspects such as transmission efficiency and system load including reducing the number of Interest packets and lookup operations performed on the related tables in routers.