TY - GEN
T1 - A greedy power-aware routing algorithm for software-defined networks
AU - Awad, Mohamad Khattar
AU - Rafique, Yousef
AU - Alhadlaq, Sarah
AU - Hassoun, Dunya
AU - Alabdulhadi, Asmaa
AU - Thani, Sheikha
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2017/3/23
Y1 - 2017/3/23
N2 - We consider the problem of minimizing the routing power consumption in software-defined networks. The network is composed of software-defined networking (SDN) nodes and a central controller where routing decisions are centralized. More specifically, the central controller minimizes the routing power consumption by routing flows on the minimum number of active links with the lowest discrete link rates. Thus, it maximizes the number of inactive links and the level of link rates, which reflects significant saving in power consumption. This problem is a mixed-integer programming problem and known to be NP-hard. Therefore, we propose a low-complexity greedy heuristic to minimize the number of active links and link rates by rerouting flows and aggregating them on common links. Numerical results show that the proposed algorithm achieves 17.18% to 32.97% power saving in real network topologies relative to a base shortest path algorithm. The savings are achieved with minimal increase in average path length that is less than 0.2 hops.
AB - We consider the problem of minimizing the routing power consumption in software-defined networks. The network is composed of software-defined networking (SDN) nodes and a central controller where routing decisions are centralized. More specifically, the central controller minimizes the routing power consumption by routing flows on the minimum number of active links with the lowest discrete link rates. Thus, it maximizes the number of inactive links and the level of link rates, which reflects significant saving in power consumption. This problem is a mixed-integer programming problem and known to be NP-hard. Therefore, we propose a low-complexity greedy heuristic to minimize the number of active links and link rates by rerouting flows and aggregating them on common links. Numerical results show that the proposed algorithm achieves 17.18% to 32.97% power saving in real network topologies relative to a base shortest path algorithm. The savings are achieved with minimal increase in average path length that is less than 0.2 hops.
UR - https://www.scopus.com/pages/publications/85017662052
U2 - 10.1109/ISSPIT.2016.7886047
DO - 10.1109/ISSPIT.2016.7886047
M3 - Conference contribution
AN - SCOPUS:85017662052
T3 - 2016 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2016
SP - 268
EP - 273
BT - 2016 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2016
Y2 - 12 December 2016 through 14 December 2016
ER -