TY - GEN
T1 - Enabling green networking with a power down approach
AU - Mumey, Brendan
AU - Tang, Jian
AU - Hashimoto, Saiichi
N1 - Copyright:
Copyright 2013 Elsevier B.V., All rights reserved.
PY - 2012
Y1 - 2012
N2 - The most straightforward way to reduce network power consumption is to turn off idle links and nodes (switches/routers), which we call the power down approach. In a wired network, especially in a backbone network, many links are actually 'bundles' of multiple physical cables and line cards that can be shut down independently. In this paper, we study the following routing problem for green networking in wired networks: Given a set of end-to-end communication sessions, determine how to route data traffic through the network such that total power consumption is minimized by turning off unused cables in bundled links and nodes, subject to the constraint that the traffic demand of each session is satisfied. We present an integer linear programming to provide optimal solutions. We also present two fast and effective heuristic algorithms to solve the problem in polynomial time. It has been shown by simulation results based on the Abilene network and the NSF network that the proposed heuristic algorithms consistently provide close-to-optimal solutions.
AB - The most straightforward way to reduce network power consumption is to turn off idle links and nodes (switches/routers), which we call the power down approach. In a wired network, especially in a backbone network, many links are actually 'bundles' of multiple physical cables and line cards that can be shut down independently. In this paper, we study the following routing problem for green networking in wired networks: Given a set of end-to-end communication sessions, determine how to route data traffic through the network such that total power consumption is minimized by turning off unused cables in bundled links and nodes, subject to the constraint that the traffic demand of each session is satisfied. We present an integer linear programming to provide optimal solutions. We also present two fast and effective heuristic algorithms to solve the problem in polynomial time. It has been shown by simulation results based on the Abilene network and the NSF network that the proposed heuristic algorithms consistently provide close-to-optimal solutions.
KW - Green networking
KW - power down
KW - power efficiency
KW - routing
UR - http://www.scopus.com/inward/record.url?scp=84871987727&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84871987727&partnerID=8YFLogxK
U2 - 10.1109/ICC.2012.6364006
DO - 10.1109/ICC.2012.6364006
M3 - Conference contribution
AN - SCOPUS:84871987727
SN - 9781457720529
T3 - IEEE International Conference on Communications
SP - 2867
EP - 2871
BT - 2012 IEEE International Conference on Communications, ICC 2012
T2 - 2012 IEEE International Conference on Communications, ICC 2012
Y2 - 10 June 2012 through 15 June 2012
ER -