TY - GEN
T1 - The impact of practical network constraints on the performance of energy-aware routing schemes
AU - Awad, Mohamad Khattar
AU - Neama, Ghadeer
AU - Rafique, Yousef
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/12/28
Y1 - 2015/12/28
N2 - Power consumption and CO2 emission have become a major concern over the last few years. Several recent studies have shown that servers and network equipments consume up to 45% of the energy consumption of data centers [1]. Software-defined networking is a new networking paradigm that decouples the control and data functionalities; thus, makes networks easily manageable and programmable. In software-defined networks (SDNs), the central controller has a global view of the network topology, traffic matrices and QoS requirements, which allows it to optimize the energy consumption of the network through energy-aware routing. In this paper, we investigate the impact of practical constraints, discreteness of link rates and limitation of flow rule space, on the performance of energy-aware routing schemes in SDN. The energy-aware routing problem is modeled as an integer linear program (ILP) with discrete cost function. The problem is modeled in GAMS and solved by CPLEX under real network settings and practical constraints. Results show that considering these constraints is critical in order to exploit the energy saving margin of SDNs.
AB - Power consumption and CO2 emission have become a major concern over the last few years. Several recent studies have shown that servers and network equipments consume up to 45% of the energy consumption of data centers [1]. Software-defined networking is a new networking paradigm that decouples the control and data functionalities; thus, makes networks easily manageable and programmable. In software-defined networks (SDNs), the central controller has a global view of the network topology, traffic matrices and QoS requirements, which allows it to optimize the energy consumption of the network through energy-aware routing. In this paper, we investigate the impact of practical constraints, discreteness of link rates and limitation of flow rule space, on the performance of energy-aware routing schemes in SDN. The energy-aware routing problem is modeled as an integer linear program (ILP) with discrete cost function. The problem is modeled in GAMS and solved by CPLEX under real network settings and practical constraints. Results show that considering these constraints is critical in order to exploit the energy saving margin of SDNs.
KW - Energy-aware routing
KW - Network Optimization
KW - Software Defined Networks
UR - http://www.scopus.com/inward/record.url?scp=84963612802&partnerID=8YFLogxK
U2 - 10.1109/SOLI.2015.7367595
DO - 10.1109/SOLI.2015.7367595
M3 - Conference contribution
AN - SCOPUS:84963612802
T3 - 10th IEEE Int. Conf. on Service Operations and Logistics, and Informatics, SOLI 2015 - In conjunction with ICT4ALL 2015
SP - 77
EP - 81
BT - 10th IEEE Int. Conf. on Service Operations and Logistics, and Informatics, SOLI 2015 - In conjunction with ICT4ALL 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 10th IEEE International Conference on Service Operations and Logistics, and Informatics, SOLI 2015 - In conjunction with ICT4ALL 2015
Y2 - 15 November 2015 through 17 November 2015
ER -
