Energy Aware Two Disjoint Paths Routing

Network robustness and throughput can be improved by routing each source-to-terminal (sd, td) demand d via two disjoint paths (2DP). However, 2DP routing increases energy usage despite yielding lower link utilization and higher redundancy. In this paper, we address the problem of minimizing the energy usage of networks that use 2DP. Specifically, our problem, called Energy-Aware Two Disjoint Paths Routing (EAR-2DP), is to maximally switch off redundant links while guaranteeing at least 0≤T≤1.0 fraction of all possible (sd, td) 2DPs remain on and their maximum link utilization (MLU) is no greater than a configured threshold. We first prove that EAR-2DP is NP-complete. Then, we design a fast heuristic solution, called Two Disjoint Paths by Shortest Path (2DP-SP). We have extensively evaluated the performance of 2DP-SP on real and/or synthetic topologies and traffic demands with two link-disjoint paths (2DP-L) and two node-disjoint paths (2DP-N). Our simulation results show that 2DP-SP can reduce network energy usage, on average, by more than 20%, even for MLU below 50%. As compared to using Shortest Path (SP) routing, while reducing energy by about 20%, 2DP-SP does not significantly affect the path length of each (sd, td) demand, even for MLU<50%. Furthermore, almost 94.2% of routes produced by 2DP-SP have route reliability up to 35% higher as compared to SP and up to 50% of the routes are only 5% less reliable than those of 2DP routing without energy savings.

[1]  Ke Xiong,et al.  Multi-constrained Shortest Disjoint Paths for Reliable QoS Routing , 2009 .

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

[3]  Rauf Izmailov,et al.  Flow splitting approach for path provisioning and path protection problems , 2002, Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie.

[4]  Rodney S. Tucker,et al.  Energy consumption in IP networks , 2008, 2008 34th European Conference on Optical Communication.

[5]  Eytan Modiano,et al.  Minimum energy disjoint path routing in wireless ad-hoc networks , 2003, MobiCom '03.

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

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

[8]  Francesca Cuomo,et al.  ESOL: Energy saving in the Internet based on Occurrence of Links in routing paths , 2011, 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[9]  Jennifer Rexford,et al.  Toward internet-wide multipath routing , 2008, IEEE Network.

[10]  Eric Osborne,et al.  Traffic Engineering with MPLS , 2002 .

[11]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

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

[13]  Konstantina Papagiannaki,et al.  Measurement and analysis of single-hop delay on an IP backbone network , 2003, IEEE J. Sel. Areas Commun..

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

[15]  M. Mellia,et al.  Energy-Aware Backbone Networks: A Case Study , 2009, 2009 IEEE International Conference on Communications Workshops.

[16]  Suresh Rai,et al.  CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks , 1991, IEEE Trans. Parallel Distributed Syst..

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

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

[19]  Dave Katz,et al.  Traffic Engineering (TE) Extensions to OSPF Version 2 , 2003, RFC.

[20]  T. V. Lakshman,et al.  Preconfiguring IP-over-Optical Networks to Handle Router Failures and Unpredictable Traffic , 2007, IEEE J. Sel. Areas Commun..

[21]  Madhav V. Marathe,et al.  The Confluent Capacity of the Internet: Congestion vs. Dilation , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[22]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[23]  Hiroshi Suzuki,et al.  Fast bandwidth reservation scheme with multi-link and multi-path routing in ATM networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[24]  Koushik Kar,et al.  Routing restorable bandwidth guaranteed connections using maximum 2-route flows , 2003, TNET.

[25]  Murali S. Kodialam,et al.  Preconfiguring IP-Over-Optical Networks to Handle Router Failures and Unpredictable Traffic , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[26]  Kwan-Wu Chin,et al.  Efficient heuristics for energy-aware routing in networks with bundled links , 2013, Comput. Networks.

[27]  Rajeev Rastogi,et al.  Algorithms for computing QoS paths with restoration , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[28]  Edoardo Amaldi,et al.  Energy-aware IP traffic engineering with shortest path routing , 2013, Comput. Networks.

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

[30]  Weifa Liang,et al.  Robust routing in wide-area WDM networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

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

[32]  Kwan-Wu Chin,et al.  Power-aware routing in networks with delay and link utilization constraints , 2012, 37th Annual IEEE Conference on Local Computer Networks.

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

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

[35]  Ramesh Bhandari.  Optimal diverse routing in telecommunication fiber networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

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

[37]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[38]  Martin L. Shooman,et al.  Reliability of Computer Systems and Networks: Fault Tolerance,Analysis,and Design , 2002 .

[39]  Anurag Srivastava,et al.  PESO: low overhead protection for Ethernet over SONET transport , 2004, IEEE INFOCOM 2004.

[40]  Li-Shiuan Peh,et al.  Design-space exploration of power-aware on/off interconnection networks , 2004, IEEE International Conference on Computer Design: VLSI in Computers and Processors, 2004. ICCD 2004. Proceedings..

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