Energy aware routing and traffic management for software defined networks

Abstract

Abstract-Since traffic diversity and volume increase with growing popularity of mobile applications, there is the strong need to manage the traffic carried by networks. Software defined networks can simplify network management while enabling new services by employing traffic management including routing whose goal is to maximize the given utility while satisfying capacity requirements. In this paper, we propose an efficient routing algorithm to minimize the cost based on power consumption determined by the number of active OpenFlow switches in a software defined network while satisfying throughput requirements of all flows according to constraints on link capacities in the network. We evaluate the performance of the proposed algorithm based on the number of active switches for different network topologies with various scenarios.

Joint Routing and Resource Allocation for Software Defined Mobile Networks

“…The power consumption is calculated by taking into account both switch and port usage in total. According to the power consumption results given in Figure 6, the proposed joint routing and resource allocation in SDMN saves the power between 20W and 100W compared to the proposed routing with only SDN in [6] for all network topologies. Moreover, the power consumption the first network topology is less than the first Waxman topology since the number of OpenFlow swicthes in the first network topology are low.…”

“…The proposed joint routing and resource allocation in SDMN achieves better performances for all types of network topologies compared to the proposed routing with only SDN in [6] which examined the energy efficient routing algorithm by decreasing the number of active switches while satisfying only throughput constraints without C-RAN. The power consumption is calculated by taking into account both switch and port usage in total.…”

“…In [5], an energy efficient controller association algorithm was given by switching off the maximum number of links by taking into account several constraints on delay, link and controller load. In our previous work in [6], an energy efficient routing algorithm to decrease the number of active OpenFlow switches in the network without taking into account the delay constraints have been presented. In [7], an efficient and effective video transmission scheme for enhancement of video delivery was examined by using genetic algorithm based SDN routing algorithm.…”

Energy-Aware Routing in Software-Defined Network using Compression

“…Some recent works [17,18,19,20] consider the problem of optimizing the power consumption in SDN using an energy-aware tra c engineering approach that minimizes the number of links. They present formulation of the optimization problem involving routing requirements for control and data plane communications.…”

Power‐efficient routing for SDN with discrete link rates and size‐limited flow tables: A tree‐based particle swarm optimization approach

“…In a study, Wang et al developed a low‐complexity greedy algorithm to route flows by aggregating them over the least number of links while considering packet delay and link utilization constraints. Özbek et al presented a greedy routing algorithm to minimize the network power consumption by switching off inactive devices, while provisioning traffic demands. Similarly, in another study, Markiewicz et al presented a heuristic method with 4 different strategies to switch on the minimum number of network devices and links, such that traffic is routed and network power consumption is minimized.…”