Towards fast rerouting-based energy efficient routing

The inefficiency of energy usage on the Internet has become a critical problem with its rapid growth, as all network devices operate at full capacity in spite of the real traffic load. Existing studies try to develop energy efficient routings by aggregating traffic and switching underutilized devices into sleep mode. However, most existing approaches do not address the problem of routing convergence well. Since traffic changes frequently in a network, routing convergence may be triggered frequently for an energy efficient routing, which may induce routing loops and black holes, resulting in severe packet loss. In this paper, we present a fast rerouting-based (FRR-based) energy efficient routing scheme, namely GreenFRR, which leverages the technique of fast rerouting to reduce the convergence time. We first study typical fast rerouting techniques and address the challenge of guaranteeing loop-free routing. Then, we formalize the FRR-based energy efficient routing problem and prove that the problem is NP-hard. In order to solve this problem, we design heuristic algorithms to maximize the number of sleeping links. In particular, we consider link utilization ratio and path stretch in our algorithms. We evaluate our scheme by simulations on real and synthetic topologies with real and synthetic traffic traces. The results show that the power consumed by line cards achieves a saving of 40% and the convergence time can be reduced by 95%.

[1]  Steven H. Low,et al.  Energy-efficient congestion control , 2012, SIGMETRICS '12.

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

[3]  Marco Mellia,et al.  Distributed algorithms for green IP networks , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[4]  Francesca Cuomo,et al.  Network pruning for energy saving in the Internet , 2012, Comput. Networks.

[5]  Amund Kvalbein,et al.  Fast Recovery From Dual-Link or Single-Node Failures in IP Networks Using Tunneling , 2010, IEEE/ACM Transactions on Networking.

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

[7]  Alia Atlas,et al.  Fast Reroute Extensions to RSVP-TE for LSP Tunnels , 2005, RFC.

[8]  Jean-Louis Rougier,et al.  GRiDA: GReen Distributed Algorithm for energy-efficient IP backbone networks , 2012, Comput. Networks.

[9]  Mingwei Xu,et al.  Hop-by-hop computing for green Internet routing , 2013, 2013 21st IEEE International Conference on Network Protocols (ICNP).

[10]  Mingwei Xu,et al.  Greening data center networks with throughput-guaranteed power-aware routing , 2013, Comput. Networks.

[11]  Marco Mellia,et al.  Modeling sleep mode gains in energy-aware networks , 2013, Comput. Networks.

[12]  Alia Atlas,et al.  Basic Specification for IP Fast Reroute: Loop-Free Alternates , 2008, RFC.

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

[14]  Jaideep Chandrashekar,et al.  Building a Power-Proportional Software Router , 2012, USENIX Annual Technical Conference.

[15]  Chen-Nee Chuah,et al.  Characterization of Failures in an Operational IP Backbone Network , 2008, IEEE/ACM Transactions on Networking.

[16]  W. Lu,et al.  Low-Power TCAMs for Very Large Forwarding Tables , 2010, IEEE/ACM Transactions on Networking.

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

[18]  Olivier Bonaventure,et al.  Achieving sub-second IGP convergence in large IP networks , 2005, CCRV.

[19]  Ralf Steinmetz,et al.  Generating realistic ISP-level network topologies , 2003, IEEE Communications Letters.

[20]  Alexander A. Kist,et al.  Dynamic topologies for sustainable and energy efficient traffic routing , 2011, Comput. Networks.

[21]  Alice Chen,et al.  Link weight assignment and loop-free routing table update for link state routing protocols in energy-aware internet , 2012, Future Gener. Comput. Syst..

[22]  Masayuki Murata,et al.  MODELS OF LINK CAPACITY DISTRIBUTION IN ISP'S ROUTER-LEVEL TOPOLOGY , 2011 .

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

[24]  Marco Canini,et al.  Identifying and using energy-critical paths , 2011, CoNEXT '11.

[25]  Jianping Wu,et al.  Safe and Practical Energy-Efficient Detour Routing in IP Networks , 2014, IEEE/ACM Transactions on Networking.

[26]  Mohamed Cheriet,et al.  Environmental-aware virtual data center network , 2012, Comput. Networks.

[27]  Kai-Yeung Siu,et al.  New dynamic SPT algorithm based on a ball-and-string model , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[28]  Attahiru Sule Alfa,et al.  IP Traffic Matrix Estimation Methods: Comparisons and Improvements , 2006, 2006 IEEE International Conference on Communications.

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

[30]  Young-Min Kim,et al.  Ant colony based self-adaptive energy saving routing for energy efficient Internet , 2012, Comput. Networks.

[31]  Cándido López-García,et al.  Optimal configuration of Energy-Efficient Ethernet , 2012, Comput. Networks.

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

[33]  Tomas Nordström,et al.  Energy-saving by low-power modes in ADSL2 , 2012, Comput. Networks.

[34]  Marco Listanti,et al.  An OSPF enhancement for energy saving in IP networks , 2011, 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).