Energy consumption optimization for software defined networks considering dynamic traffic

Today´s networking hardware (e.g. switches, routers) is typically running 24/7, regardless of the traffic volume. This is because in current networks, the controlling and data forwarding functions are embedded in the same devices, and all L2/L3 network protocols are designed to work in a distributed manner. Therefore, network devices must be switched on all the time to handle the traffic. This consequently results in very high global energy consumption of communication networks. Software Defined Networking was recently introduced as a new networking paradigm, in which the control plane is physically separated from the forwarding plane and moved to a globally-aware software controller. As a consequence, traffic can be monitored in real time and rerouted very fast regarding certain objectives such as load balancing or QoS enhancement. Accordingly, it opens new opportunities to improve the overall network performance in general and the energy efficiency in particular. This paper proposes an approach that reconfigures the network in order to reduce the energy consumption, based on the current traffic load. Our main idea is to switch on a minimum amount of necessary switches/routers and links to carry the traffic. We first formulate the problem as a mixed integer linear programming (MILP) problem and further present a heuristic method, so called Strategic Greedy Heuristic, with four different strategies, to solve the problem for large networks. We have carried out extensive simulations for a typical campus network and arbitrary mesh networks with realistic traffic information and energy consumption, to prove the potential energy saving of the proposed approach. The results showed that we can save up to 45% of the energy consumption at nighttime.