Restorable Energy Aware Routing with Backup Sharing in Software Defined Networks

—Energy aware routing with restoration is of much importance for the network to enhance reliability as the relatively concentrated traffic makes the network vulnerable to link failures and sudden traffic bursts after energy saving. For restoration, each request has an active path and a link disjoint backup path. With sufficient path routing knowledge, backup paths can be shared for bandwidth efficiency. This is possible in Software Defined Networks (SDNs) owing to the centralized controller which can collect global information. In this paper, we first combine energy saving with restoration and address the problem called Restorable Energy Aware Routing with Backup Sharing (REAR-BS) in SDNs during off-peak hours when backup sharing is allowed. We formulate a nonlinear integer programming model to minimize the number of used links while putting idle ones to sleep under constraints of maximum link utilization and restoration. We rewrite it as a linear model and give a lower bound for this NP-hard problem. Then, we design a heuristic algorithm called Green Restorable Algorithm (GreRA) to tackle this problem. Extensive simulation results on real and synthetic topologies and traffic demands show the effectiveness of GreRA when compared to CPLEX solutions, shortest path routing with restoration and lower bound.

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

[2]  Marco Mellia,et al.  Minimizing ISP Network Energy Cost: Formulation and Solutions , 2012, IEEE/ACM Transactions on Networking.

[3]  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).

[4]  Murali S. Kodialam,et al.  Dynamic routing of bandwidth guaranteed tunnels with restoration , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[5]  Matthew Roughan,et al.  Experience in measuring internet backbone traffic variability: Models metrics, measurements and meaning , 2003 .

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

[7]  Frédéric Giroire,et al.  Optimizing rule placement in software-defined networks for energy-aware routing , 2014, 2014 IEEE Global Communications Conference.

[8]  Ariel Orda,et al.  Algorithms for computing QoS paths with restoration , 2005, IEEE/ACM Transactions on Networking.

[9]  Srikanth Kandula,et al.  Walking the tightrope: responsive yet stable traffic engineering , 2005, SIGCOMM '05.

[10]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[11]  Oznur Ozkasap,et al.  State-ofthe-art Energy Efficiency Approaches in Software Defined Networking , 2015 .

[12]  Stephen J. Wright,et al.  Power Awareness in Network Design and Routing , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[13]  Anja Feldmann,et al.  Logically centralized?: state distribution trade-offs in software defined networks , 2012, HotSDN '12.

[14]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[15]  Kwan-Wu Chin,et al.  Reliable green routing using two disjoint paths , 2014, 2014 IEEE International Conference on Communications (ICC).

[16]  Yehoshua Perl,et al.  Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph , 1978, JACM.

[17]  Bin Liu,et al.  GreenTE: Power-aware traffic engineering , 2010, The 18th IEEE International Conference on Network Protocols.

[18]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[19]  Marco Mellia,et al.  Reducing Power Consumption in Backbone Networks , 2009, 2009 IEEE International Conference on Communications.

[20]  T. V. Lakshman,et al.  Restorable dynamic quality of service routing , 2002 .

[21]  Kwan-Wu Chin,et al.  Energy Aware Two Disjoint Paths Routing , 2014, J. Netw. Comput. Appl..

[22]  Sujata Banerjee,et al.  ElasticTree: Saving Energy in Data Center Networks , 2010, NSDI.

[23]  Frédéric Giroire,et al.  Minimization of network power consumption with redundancy elimination , 2015, Comput. Commun..

[24]  Martin Suchara,et al.  Greening backbone networks: reducing energy consumption by shutting off cables in bundled links , 2010, Green Networking '10.

[25]  Edith Cohen,et al.  Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.

[26]  Albert G. Greenberg,et al.  Experience in measuring backbone traffic variability: models, metrics, measurements and meaning , 2002, IMW '02.

[27]  Koushik Kar,et al.  Routing restorable bandwidth guaranteed connections using maximum 2-route flows , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[28]  B. Dhoedt,et al.  Worldwide energy needs for ICT: The rise of power-aware networking , 2008, 2008 2nd International Symposium on Advanced Networks and Telecommunication Systems.

[29]  Steve Uhlig,et al.  Providing public intradomain traffic matrices to the research community , 2006, CCRV.

[30]  Oznur Ozkasap,et al.  State-of-the-art Energy Efficiency Approaches in Software Defined Networking , 2015 .

[31]  Yuchun Guo,et al.  Link‐disjoint paths for reliable QoS routing , 2003, Int. J. Commun. Syst..

[32]  Suresh Singh,et al.  Greening of the internet , 2003, SIGCOMM '03.

[33]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .