A Priority based Energy Aware Routing Algorithm for SDN Enabled Data Center Network

Recently the number of data centers has increased tremendously to transport and manage the massive volume of data generated from various sources. As the network devices in data centers continue to increase at an alarming rate hence the need for efficient routing to handle this vast amount of data has emerged as a major concern. This increase in data flow adds many devices that consume a major portion of energy. As a result, maintaining the importance of data flow, and energy conservation are the critical considerations for an efficient routing path. Recently, SDN (Software Defined Network) has been used to improve the performance of DCN (Data Center Network) by reducing the amount of physical infrastructure required. This work proposes a novel admission and routing scheme that considers arbitrarily assigned priorities for network flows and path energy for data packet transmissions. Using the SDN paradigm in DCN, we attempt to maximize the number of flows as well as minimize the energy consumption in the network. For this, a MILP (Mixed Integer Linear Programming) problem is formulated by jointly considering flow priority and path energy. Later, we introduce a greedy method named Priority Based Energy Minimization Algorithm (PEMA) to maximize the flow and minimize the energy as much as possible. Finally, the performance of the routing strategy is observed by comparing it with stat-of-the-art works..