A VCP-based Congestion Control Algorithm in Named Data Networking

Abstract

With further research on Named Data Networking (NDN), congestion control is one of the most key modules of NDN system. Since content can be retrieved from multiple sources and through multiple paths, traditional implicit-feedback congestion control mechanism based on retransmission time out (RTO) estimate is not applicable for NDN architecture. Based on the theory of Variable-Structure Congestion Control Protocol (VCP), an improved Explicit Congestion Control Algorithm was proposed in the paper to address this problem. With proposed algorithm, intermediate router computes a ‘load factor’ which indicates the level of network congestion, and adds it in Data packets which return back to client, so that the client can actively adjust its request- sending rate according to the load factor. The simulation implemented on the ns3-based NDN simulator (ndnSIM) shows that: compared with traditional Additive Increase Multiplicative Decrease (AIMD) algorithm, the proposed algorithm can significantly enhance the efficiency and stability of data transmission.