Priority based energy and load aware routing algorithms for SDN enabled data center network

Abstract

Nowadays, to accommodate the swift expansion of cloud computing, big data, and other emerging technologies, integrating data center networks and SDN (Software Defined Network) is suggested, which also improves the network management’s convenience and flexibility. As network devices in these data centers continue to increase at a high rate, efficient route management to handle these devices’ vast amounts of data has emerged as a significant concern. This work suggests a novel admission and routing scheme considering the importance or priorities of the network flows, path energy, and routing path load. Using the SDN paradigm in DCN (Data Center Network), we first develop a Mixed Integer Linear Programming (MILP) formulation by jointly considering flow priority, path energy, and path load. The MILP formulation can maximize the number of flows as well as minimize the energy consumption and load variance in the network, or it can make a trade-off among all three. However, due to the potentially long running time, later, we introduce two greedy methods, Priority Based Energy Minimization Algorithm (PEMA) and Priority Based Evenly Load Distribution Algorithm (PEDL), where PEMA aims to maximize the flow with less energy, and PEDL focuses on maximizing the flow with reduced load variation. Finally, the developed routing strategies are implemented, and the simulation results demonstrate the out-performance of our work compared to the existing works in terms of successful flow ratio, energy savings, and load balancing.