A novel content-aware multipath routing concept exploiting random utility theory principles

This paper presents a novel multipath routing concept for content-aware networks, enabling better resource utilization and end-to-end QoS provision. Based on random utility theory and traffic identification techniques it delves into multinomial-type probability for efficient packet distribution among intra domain paths, by exploiting the capability of edge nodes to identify the content in transit, and proposes a network architecture where this concept may be applied. We focus on the methodology alterations that content-awareness will impose on the calculation of the utility that a corresponding packet will inherit in choosing a specific path, assuming that packets of “premium” content will have demanding QoS-centric network “taste” when they will have to choose a specific path.

[1]  Masaki Aida,et al.  A New Multi-Path Routing Methodology Based on Logit Type Assignment , 2009, 2009 IEEE Globecom Workshops.

[2]  Niccolo Cascarano,et al.  Optimizing Deep Packet Inspection for High-Speed Traffic Analysis , 2011, Journal of Network and Systems Management.

[3]  Srinivas Naga Vutukury,et al.  Multipath routing mechanisms for traffic engineering and quality of service in the internet , 2001 .

[4]  Evangelos Pallis,et al.  A preliminary implementation of a Content-Aware network node , 2011, 2011 IEEE International Conference on Multimedia and Expo.

[5]  Hiroshi Suzuki,et al.  Fast bandwidth reservation scheme with multi-link and multi-path routing in ATM networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[6]  Evangelos Pallis,et al.  Enhancing legacy infrastructures with content-aware enablers towards a networked-media platform , 2011, 2011 IEEE International Conference on Multimedia and Expo.

[7]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[8]  Grenville J. Armitage,et al.  A survey of techniques for internet traffic classification using machine learning , 2008, IEEE Communications Surveys & Tutorials.

[9]  Angela L. Chiu,et al.  Overview and Principles of Internet Traffic Engineering , 2002, RFC.

[10]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[11]  Judith Kelner,et al.  A stratified traffic sampling methodology for seeing the big picture , 2008, Comput. Networks.

[12]  Judith Kelner,et al.  A Survey on Internet Traffic Identification , 2009, IEEE Communications Surveys & Tutorials.

[13]  Kai-Yeung Siu,et al.  Efficient Algorithms for Multi-Path Link-State Routing , 1999 .

[14]  Antonio Pescapè,et al.  Issues and future directions in traffic classification , 2012, IEEE Network.

[15]  Ariel Orda,et al.  Multipath routing algorithms for congestion minimization , 2007, IEEE/ACM Trans. Netw..

[16]  Andrew W. Moore,et al.  Bayesian Neural Networks for Internet Traffic Classification , 2007, IEEE Transactions on Neural Networks.

[17]  Konstantina Papagiannaki,et al.  Toward the Accurate Identification of Network Applications , 2005, PAM.

[18]  J. J. Garcia-Luna-Aceves,et al.  MDVA: a distance-vector multipath routing protocol , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[19]  J. Noel Chiappa,et al.  The Nimrod Routing Architecture , 1996, RFC.

[20]  Kenneth E. Train,et al.  Discrete Choice Methods with Simulation , 2016 .

[21]  J. J. Garcia-Luna-Aceves,et al.  A simple approximation to minimum-delay routing , 1999, SIGCOMM '99.