An extended Hop-by-hop interest shaping mechanism for content-centric networking

The evolution of the Internet has triggered a significant activity exploring new architectures among which the concept of Information-Centric-Networks (ICN) has emerged. Considering the various ICN solutions, Content-Centric Networking (CCN) is the one that received most attention. The design of CCN is progressing albeit many important issues still deserve a careful analysis and design. In this paper, we cover the important problem of congestion control in CCN and develop our hop-by-hop Interest Shaping mechanism (HoBHIS) framework. We present the foundation and general properties of our solution. We then study the behaviour of HoBHIS and demonstrate the fairness of resource sharing in presence of multiple active conversations. Further, we introduce a mechanism to control the user behavior in order to limit its ability to submit requests in excess creating a potential risk for buffer overflow. We demonstrate the effectiveness of the proposed solutions and provide a performance analysis using the implementation of our schemes in ndnSIM. We show that HoBHIS provides an adequate and efficient solution to the general problem of congestion control in CCN.

[1]  Alexander Afanasyev,et al.  Adaptive forwarding in named data networking , 2012, CCRV.

[2]  Abdesselem Kortebi,et al.  Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing , 2005, SIGMETRICS '05.

[3]  Injong Rhee,et al.  An improved hop-by-hop interest shaper for congestion control in named data networking , 2013, ICN '13.

[4]  Massimo Gallo,et al.  Multipath congestion control in content-centric networks , 2013, 2013 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[5]  George Pavlou,et al.  CCTCP: A scalable receiver-driven congestion control protocol for content centric networking , 2013, 2013 IEEE International Conference on Communications (ICC).

[6]  Christian F. Tschudin,et al.  An Empirical Study of Receiver-Based AIMD Flow-Control Strategies for CCN , 2013, 2013 22nd International Conference on Computer Communication and Networks (ICCCN).

[7]  Jean-Yves Le Boudec,et al.  Global fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Massimo Gallo,et al.  Joint hop-by-hop and receiver-driven interest control protocol for content-centric networks , 2012, CCRV.

[9]  Steven McCanne,et al.  On improving the fairness of TCP congestion avoidance , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[10]  Alexander Afanasyev,et al.  journal homepage: www.elsevier.com/locate/comcom , 2022 .

[11]  Serge Fdida,et al.  An effective hop-by-hop Interest shaping mechanism for CCN communications , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[12]  Christian F. Tschudin,et al.  CCN & TCP co-existence in the future Internet: Should CCN be compatible to TCP? , 2013, 2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013).

[13]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[14]  James Roberts,et al.  Flow-aware traffic control for a content-centric network , 2012, 2012 Proceedings IEEE INFOCOM.

[15]  Massimo Gallo,et al.  ICP: Design and evaluation of an Interest control protocol for content-centric networking , 2012, 2012 Proceedings IEEE INFOCOM Workshops.