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.