A RCP-Based Congestion Control Protocol in Named Data Networking

As the rising applications of Named Data Networking (NDN) continue to increase the demand on network bandwidth, developing effective congestion mechanisms has become one of the high-priority research tasks for NDN architecture. This paper explores rate control protocol (RCP), a unique hop-by-hop feature in NDN routing, and one-to-one relationship between interest requests and data packets to develop a novel congestion control mechanism for NDN. Specifically, we have designed and implemented a rate-based, explicit and hop-by-hop congestion control algorithm, NDN Hop-by-Hop RCP, namely NHBH-RCP, to achieve high link utilization and increase overall network throughput. In addition, we compare the naive congestion control algorithm in NDN with NHBH-RCP via various experiments and find that our proposed algorithm significantly enhances the performance of data transfer in NDN and reduces flow-completion time between consumers and producers.