Adaptive traffic scheduling via network coding in NDN

Abstract

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.