Coherency Routing Algorithm with Redundancy Elimination in Software Defined Data Center Networks

With the explosive expansion of data centers, a huge amount of identical or similar data are usually requested repeatedly over networks by users, which causes serious waste of network bandwidth, and further increases network energy consumption remarkably. Existing solutions achieve energy saving by increasing network link capacity as well as eliminating the data redundancy in routers. However, such redundancy elimination (RE) causes the increase of router's energy consumption. To solve this problem, we propose a flow preemption routing scheme with RE called RE-FPR. RE-FPR scheme uses software defined networking (SDN) technology to select different routing paths for flows and control RE function on the corresponding router under two modes, i.e., traffic peak and traffic valley. We then formulate the RE-FPR problem as a power consumption minimization problem. Furthermore, we solve the optimization problem by using the maximum entropy principle and propose the RE-FPR algorithm. The simulation results show that RE-FPR algorithm outperforms the traditional flow scheduling algorithms in terms of flow completion time and number of active RE- routers / links.