An Approximation Algorithm for Incrementally Deploying SDN Forwarding Devices

There are two main optimization problems in software defined networks' traffic engineering, selecting conventional nodes to upgrade to SDN nodes, and finding a routing technique that minimize link utilization. While the second problem is almost solved, there are still not many theoretical results for the first problem. The approximation ratio of the only approximation algorithm for these problems is still as large as O(n), when n is the number of nodes. In this paper, we show that the problem is NP-hard, even for the single-source single-sink case. We then develop an algorithm for the case, and prove that our algorithm is kd-approximation algorithm, when k is the number of nodes to upgrade and d is the maximum degree of networks. We strongly believe that our algorithm can be extended to general cases in future.

[1]  Wei Song,et al.  Achieving near-optimal traffic engineering in hybrid Software Defined Networks , 2015, 2015 IFIP Networking Conference (IFIP Networking).

[2]  Yonggang Wen,et al.  “ A Survey of Software Defined Networking , 2020 .

[3]  Deborah Estrin,et al.  Modelling Data-Centric Routing in Wireless Sensor Networks , 2002 .

[4]  Admela Jukan,et al.  A performance study of network migration to SDN-enabled Traffic Engineering , 2013, 2013 IEEE Global Communications Conference (GLOBECOM).

[5]  Fernando M. V. Ramos,et al.  Software-Defined Networking: A Comprehensive Survey , 2014, Proceedings of the IEEE.

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Konstantinos Poularakis,et al.  One step at a time: Optimizing SDN upgrades in ISP networks , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[8]  Moran Feldman,et al.  Constrained Monotone Function Maximization and the Supermodular Degree , 2014, APPROX-RANDOM.

[9]  Min Zhu,et al.  B4: experience with a globally-deployed software defined wan , 2013, SIGCOMM.

[10]  Andreas Krause,et al.  Submodular Function Maximization , 2014, Tractability.

[11]  Olivier Bonaventure,et al.  Opportunities and research challenges of hybrid software defined networks , 2014, CCRV.

[12]  Sujata Banerjee,et al.  Incremental Deployment of SDN in Hybrid Enterprise and ISP Networks , 2016, SOSR.

[13]  Jianping Wu,et al.  Incremental deployment for traffic engineering in hybrid SDN network , 2015, 2015 IEEE 34th International Performance Computing and Communications Conference (IPCCC).

[14]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[15]  Nick Feamster,et al.  The road to SDN: an intellectual history of programmable networks , 2014, CCRV.

[16]  Roch Guérin,et al.  Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2005, IEEE/ACM Transactions on Networking.

[17]  Klaudia Frankfurter.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

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