An Efficient Approximation Algorithm for Traffic Engineering in Software Defined Networks

In this paper, we focus on the efficient algorithm for solving the multi-commodity flow problems involved in TE and develop an improved approximation algorithm (i-FPTAS) based on the Fully Polynomial Time Approximation Scheme (FPTAS), with aim of greatly improving computational efficiency without compromising traffic load balancing performance. Numerical results shows that i-FPTAS can achieve close-optimal approximation solution which is much better than that of FPATS with the same approximate parameter, and increasing the approximate parameter of i-FPTAS can lower computational complexity with little loss on close-optimality.

[1]  Admela Jukan,et al.  A Survey on Internet Multipath Routing and Provisioning , 2015, IEEE Communications Surveys & Tutorials.

[2]  Ian F. Akyildiz,et al.  A roadmap for traffic engineering in SDN-OpenFlow networks , 2014, Comput. Networks.

[3]  T. V. Lakshman,et al.  Traffic steering in software defined networks: planning and online routing , 2014, DCC@SIGCOMM.

[4]  Thierry Turletti,et al.  A Survey of Software-Defined Networking: Past, Present, and Future of Programmable Networks , 2014, IEEE Communications Surveys & Tutorials.

[5]  Murali S. Kodialam,et al.  Traffic engineering in software defined networks , 2013, 2013 Proceedings IEEE INFOCOM.

[6]  Ning Wang,et al.  An overview of routing optimization for internet traffic engineering , 2008, IEEE Communications Surveys & Tutorials.

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

[8]  George Karakostas,et al.  Faster approximation schemes for fractional multicommodity flow problems , 2008, TALG.

[9]  Robert Gallager.  Loops in multicommodity flows , 1977, 1977 IEEE Conference on Decision and Control including the 16th Symposium on Adaptive Processes and A Special Symposium on Fuzzy Set Theory and Applications.