Parallel Multi-path Forwarding Strategy for Named Data Networking

Named Data Networking (NDN) is one of the most promising instantiations of the Information Centric Networking (ICN) philosophy. This new design needs a new thinking due to the fact that the definitions of some concepts used in TCP/IP paradigm are no longer appropriate. In this context, flow and fairness concepts are examined and new perspectives are proposed. An important literature exists about forwarding strategies and congestion control in NDN context. Unfortunately, the lack of definitions pushed many researchers to use the TCP/IP heritage. As a consequence, they neither fully benefit from the native multi-path support nor address the fairness problem. In order to overcome such a drawback and to meet end-users fairness while optimizing network throughput, a new Parallel Multi-Path Forwarding Strategy (PMP-FS) is proposed in this paper. The PMP-FS proactively splits traffic by determining how the multiple routes will be used. It takes into consideration NDN in-network caching and NDN Interest aggregation features to achieve weighted alpha fairness among different flows. Obtained preliminary results show that PMP-FS looks promising.

[1]  Peter Ashwood-Smith,et al.  Real time alpha-fairness based traffic engineering , 2014, HotSDN.

[2]  Patrick Crowley,et al.  Scalable Pending Interest Table design: From principles to practice , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[3]  Alexander Afanasyev,et al.  SNAMP: Secure namespace mapping to scale NDN forwarding , 2015, 2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[4]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[5]  Dipankar Raychaudhuri,et al.  Comparing alternative approaches for networking of named objects in the future Internet , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[6]  Christos Douligeris,et al.  Fairness in network optimal flow control: optimality of product forms , 1991, IEEE Trans. Commun..

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

[8]  F. Kelly Charging and Rate Control for Elastic Traac , 1997 .

[9]  Thomas Voice,et al.  Stability and fairness of explicit congestion control with small buffers , 2008, CCRV.

[10]  Yaogong Wang Caching, Routing and Congestion Control in a Future Information-Centric Internet , 2013 .

[11]  Diana K. Smetters,et al.  VoCCN: voice-over content-centric networks , 2009, ReArch '09.

[12]  E. L. Hahne,et al.  Round-Robin Scheduling for Max-Min Fairness in Data Networks , 1991, IEEE J. Sel. Areas Commun..

[13]  Alexander Afanasyev,et al.  Map-and-Encap for Scaling NDN Routing , 2015 .

[14]  Alexander Afanasyev,et al.  ndnSIM 2 . 0 : A new version of the NDN simulator for NS-3 , 2015 .

[15]  Vijay Subramanian,et al.  PIE: A lightweight control scheme to address the bufferbloat problem , 2013, 2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR).

[16]  Bob Briscoe,et al.  Flow rate fairness: dismantling a religion , 2007, CCRV.

[17]  Patrick Crowley,et al.  Scalable Name-Based Packet Forwarding: From Millions to Billions , 2015, ICN.

[18]  Davide Pesavento,et al.  NFD Developer's Guide , 2014 .

[19]  Patrick Crowley,et al.  Scalable NDN Forwarding: Concepts, Issues and Principles , 2012, 2012 21st International Conference on Computer Communications and Networks (ICCCN).

[20]  Kok-Lim Alvin Yau,et al.  Exploiting the Power of Multiplicity: A Holistic Survey of Network-Layer Multipath , 2015, IEEE Communications Surveys & Tutorials.

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

[22]  James J. Filliben,et al.  Study of proposed internet congestion control mechanisms , 2010 .

[23]  Diego Perino,et al.  A reality check for content centric networking , 2011, ICN '11.

[24]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

[25]  Patrick Crowley,et al.  Named data networking , 2014, CCRV.

[26]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[27]  Thomas Voice,et al.  Stability of Multi-Path Dual Congestion Control Algorithms , 2006, IEEE/ACM Transactions on Networking.

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