In order to reduce the greenhouse effects and environmental pollution, energy saving has become important in designing next the generation networks. Shutting down the network devices carrying light loads and redirecting the traffic flows to other routes is a way to decrease network energy consumption. Since traffic demands among node pairs vary in different time periods, the energy efficient network design is to determine the optimal network topologies for them. However, in current IP network, flows are governed by shortest path routing, thus purely determining the network topology is not enough. A set of link weight metric has to be derived in company with the network topology such that the flows on the active links can meet the physical capacity constraints. Although applying adaptive network topology could save energy consumption, however, the lack of stringent synchronization among routers would cause undesired loops during the transient period of topology changes. Removing routing images inconsistent among routers to prevent loops is a critical issue in energy efficient network and this issue is still not yet considered in the green network design. In this paper, we propose a comprehensive approach that determines network topology and link metric for each time period. Traffic engineering is considered in our design such that flows going on the energy aware network are within a predetermined percentage of the link capacity such that no congestion occurs in a statistical manner. To avoid accurate synchronization among routers, we propose using RFC 4915 Multi-Topology Routing, to resolve the transient loop problem. By controlling the update sequence in MTR, there is no transient loop during the period of topology changes. We formulate an integer linear programming to jointly determine this multi-topology and link weight assignment problem. Due to its NP-hard property, we propose an efficient algorithm, termed Lagrangean Relaxation and Harmonic Series (LR&HS) heuristic. Numerical results demonstrate that the proposed LR&HS approach outperforms the other approaches on four benchmark networks and provides up to 35%–50% energy saving in our experimental cases.
[1]
David L. Mills,et al.
Internet Engineering Task Force (ietf) Network Time Protocol Version 4: Protocol and Algorithms Specification
,
2010
.
[2]
Di Yuan,et al.
Optimization of Internet Protocol network design and routing
,
2004,
Networks.
[3]
Bruce Nordman,et al.
Managing energy consumption costs in desktop PCs and LAN switches with proxying, split TCP connections, and scaling of link speed
,
2005
.
[4]
Mikkel Thorup,et al.
Internet traffic engineering by optimizing OSPF weights
,
2000,
Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[5]
Stephen J. Wright,et al.
Power Awareness in Network Design and Routing
,
2008,
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.
[6]
Richard E. Brown,et al.
Electricity used by office equipment and network equipment in the U.S.: Detailed report and appendices
,
2001
.
[7]
Marco Mellia,et al.
Reducing Power Consumption in Backbone Networks
,
2009,
2009 IEEE International Conference on Communications.
[8]
Ravindra K. Ahuja,et al.
Network Flows: Theory, Algorithms, and Applications
,
1993
.
[9]
M. Mellia,et al.
Energy-Aware Backbone Networks: A Case Study
,
2009,
2009 IEEE International Conference on Communications Workshops.
[10]
Marco Listanti,et al.
An Energy Saving Routing Algorithm for a Green OSPF Protocol
,
2010,
2010 INFOCOM IEEE Conference on Computer Communications Workshops.
[11]
Abhay Roy,et al.
Multi-Topology (MT) Routing in OSPF
,
2007,
RFC.
[12]
C. Collier.
AN INEFFICIENT TRUTH
,
2011
.