Energy-aware routing for software-defined networks with discrete link rates: A benders decomposition-based heuristic approach

Abstract The energy efficiency of wired networks has received considerable attention over the past decade due to its economic and environmental impacts. However, because of the vertical integration of the control and data planes in conventional networks, optimizing energy consumption in such networks is challenging. Software-defined networking (SDN) is an emerging networking paradigm that decouples the control plane from the data plane and introduces network programmability for the development of network applications. In this work, we propose an energy-aware integral flow-routing solution to improve the energy efficiency of the SDN routing application. We consider discreteness of link rates and pose the routing problem as a mixed integer linear programming (MILP) problem, which is known to be NP complete. The proposed solution is a heuristic implementation of the Benders decomposition method that routes additional single and multiple flows without resolving the routing problem. Performance evaluations demonstrate that the proposed solution achieves a close-to-optimal performance (within 3.27% error) compared to CPLEX on various topologies with less than 0.056% of CPLEX average computation time. Furthermore, our solution outperforms the shortest path algorithm by 24.12% to 54.35% in power savings.

[1]  Mehdi Mrad,et al.  Optimal solution of the discrete cost multicommodity network design problem , 2008, Appl. Math. Comput..

[2]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[3]  Bruce M. Maggs,et al.  Cutting the electric bill for internet-scale systems , 2009, SIGCOMM '09.

[4]  Richard E. Rosenthal,et al.  GAMS -- A User's Guide , 2004 .

[5]  Franco Davoli,et al.  Energy Efficiency in the Future Internet: A Survey of Existing Approaches and Trends in Energy-Aware Fixed Network Infrastructures , 2011, IEEE Communications Surveys & Tutorials.

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

[7]  Lisa Zhang,et al.  Routing for Energy Minimization in the Speed Scaling Model , 2010, 2010 Proceedings IEEE INFOCOM.

[8]  Alysson M. Costa,et al.  Benders, metric and cutset inequalities for multicommodity capacitated network design , 2009, Comput. Optim. Appl..

[9]  Jim Esch,et al.  Software-Defined Networking: A Comprehensive Survey , 2015, Proc. IEEE.

[10]  Jie Wu,et al.  Multi-resource energy-efficient routing in cloud data centers with network-as-a-service , 2015, 2015 IEEE Symposium on Computers and Communication (ISCC).

[11]  Lin Wang,et al.  Routing for Energy Minimization with Discrete Cost Functions , 2013, ArXiv.

[12]  G. Fettweis,et al.  ICT ENERGY CONSUMPTION – TRENDS AND CHALLENGES , 2008 .

[13]  Lin Wang,et al.  Energy-Efficient Network Routing with Discrete Cost Functions , 2012, TAMC.

[14]  M. Stoer,et al.  A polyhedral approach to multicommodity survivable network design , 1994 .

[15]  Jian Tang,et al.  On exploiting flow allocation with rate adaptation for green networking , 2012, 2012 Proceedings IEEE INFOCOM.

[16]  Jie Wu,et al.  Randomized oblivious integral routing for minimizing power cost , 2015, Theor. Comput. Sci..

[17]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[18]  Sujata Banerjee,et al.  A Power Benchmarking Framework for Network Devices , 2009, Networking.

[19]  M. Iri.  ON AN EXTENSION OF THE MAXIMUM-FLOW MINIMUM-CUT THEOREM TO MULTICOMMO))ITY FLOWS , 1971 .

[20]  Michel Minoux,et al.  Exact solution of multicommodity network optimization problems with general step cost functions , 1999, Oper. Res. Lett..

[21]  Ghadeer Neama,et al.  The impact of practical network constraints on the performance of energy-aware routing schemes , 2015, 2015 IEEE International Conference on Service Operations And Logistics, And Informatics (SOLI).

[22]  Michal Pióro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010, Networks.

[23]  Michel Minoux,et al.  Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods , 2001, Ann. Oper. Res..

[24]  Rui Wang,et al.  Energy-aware routing algorithms in Software-Defined Networks , 2014, Proceeding of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks 2014.

[25]  Lisa Zhang,et al.  Routing and scheduling for energy and delay minimization in the powerdown model , 2013, Networks.

[26]  Erol Gelenbe,et al.  The impact of information technology on energy consumption and carbon emissions , 2015, UBIQ.

[27]  Cees T. A. M. de Laat,et al.  Joint flow routing-scheduling for energy efficient software defined data center networks: A prototype of energy-aware network management platform , 2016, J. Netw. Comput. Appl..

[28]  Andreas Timm-Giel,et al.  Energy consumption optimization for software defined networks considering dynamic traffic , 2014, 2014 IEEE 3rd International Conference on Cloud Networking (CloudNet).

[29]  Michel Minoux,et al.  A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem , 2003, J. Heuristics.

[30]  Sergiu Nedevschi,et al.  Reducing Network Energy Consumption via Sleeping and Rate-Adaptation , 2008, NSDI.

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

[32]  Didier Colle,et al.  Trends in worldwide ICT electricity consumption from 2007 to 2012 , 2014, Comput. Commun..