RE-FPR: flow preemption routing scheme with redundancy elimination in Software Defined Data Center Networks

Abstract With the explosive expansion of data center sizes, a large number of the same or similar contents are requested repeatedly by the users on network edge, which causes a serious waste of network bandwidth, and further makes the network energy consumption increase remarkably. The current researches achieve energy saving by increasing network link capacity as well as eliminating the data redundancy in routers. But the existing redundancy elimination may cause the increase of router's energy consumption. To solve this problem, we propose a flow preemption routing scheme with redundancy elimination (RE-FPR). The RE-FPR scheme uses software defined networking (SDN) technology to select different routing paths for the traffic flow and control RE function on the corresponding router under two modes, i.e., traffic peak and traffic valley. Specifically, the RE-FPR scheme also employs the SDN controller to update flow states and link states of the network. We then formulate the RE-FPR problem as a power consumption minimization problem subject to flow conservation constraint and link capacity constraint. Furthermore, we solve the optimization problem by using the maximum entropy principle and propose the RE-FPR algorithm. The simulation results show that the RE-FPR algorithm outperforms the traditional flow scheduling algorithms in term of flow completion time and the number of active RE-routers/links.