An Effective Congestion Control Scheme in Content-Centric Networking

Content-Centric Networking (CCN), a typical future Internet architecture focused on content dissemination and retrieval, brings a paradigm shift in network model by addressing named-data instead of host location. Many fields related to CCN become the research hotspots, such as caching and name-based routing. However, little work has addressed on its transmission protocol in literature. In this paper, we proposed an effective Congestion Control Scheme (CCS) in CCN through combining a router-driven congestion forecast with a requester-driven Interest control protocol. Each router detects the network congestion status and then informs the requester by setting Congestion Information Bits into the returned Data packet passed by. Then the requester dynamically adjusts its Interest sending window according to the received feedback congestion information. Furthermore, in our scheme, a Fair Queuing algorithm is used on each router, allowing max-min fair share of the link capacity. A performance evaluation using simulation designed on OMNet++ network simulator showed that the proposed CCS causes fewer packet losses, decreases Data packet delay, treats each flow fairly and maximizes the use of bandwidth.