Performance comparison of QoS routing algorithms applicable to large-scale SDN networks

In Software Defined Networking (SDN) the network control plane is decoupled from the data plane and centralized at programmable controller. One of the advantages of centralized control is possibility to efficiently implement traffic engineering mechanisms, that are still lacking in today's backbone networks due to instability of distributed routing protocols and high management complexity. In this paper, we analysed suitability of different routing algorithms for dynamic setting up of performance guaranteed traffic tunnels in backbone SDN networks. Two routing constraints were considered: bandwidth and path delay. Beside bandwidth rejection ratio, which is commonly used as performance indicator for QoS (Quality of Service) routing algorithms, in the context of SDN low computational time is pointed out as important requirement.

[1]  Igor Radusinovic,et al.  SDN control framework for QoS provisioning , 2014, 2014 22nd Telecommunications Forum Telfor (TELFOR).

[2]  Preeti Singh,et al.  Application-aware aggregation and traffic engineering in a converged packet-circuit network , 2011, 2011 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference.

[3]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[4]  Fouad A. Tobagi,et al.  Provisioning IP backbone networks to support latency sensitive traffic , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  Peter Steenkiste,et al.  On path selection for traffic with bandwidth guarantees , 1997, Proceedings 1997 International Conference on Network Protocols.

[6]  Klara Nahrstedt,et al.  Routing Support for Providing Guaranteed End-to-End Quality-of-Service , 1999 .

[7]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[8]  Gunjan Tank,et al.  Software-Defined Networking-The New Norm for Networks , 2012 .

[9]  Raouf Boutaba,et al.  DORA: Efficient Routing for MPLS Traffic Engineering , 2002, Journal of Network and Systems Management.

[10]  Sakir Sezer,et al.  Queen ' s University Belfast-Research Portal Are We Ready for SDN ? Implementation Challenges for Software-Defined Networks , 2016 .

[11]  Zheng Wang,et al.  Routing Algorithms for Supporting Resource Reservation , 1994 .

[12]  Murali S. Kodialam,et al.  Minimum interference routing with applications to MPLS traffic engineering , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[13]  Yi Yang,et al.  Quality of service routing algorithms for bandwidth-delay constrained applications , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[14]  Subhash Suri,et al.  Profile-Based Routing: A New Framework for MPLS Traffic Engineering , 2001, QofIS.