Coflow-aware dynamic routing for SDN-based data center networks

A lot of research has been proposed to improve network performance in the data center. However, with the development of distributed applications, these applications face a new performance bottleneck since existing solutions almost ignore the application level optimization. The concept of coflow has been proposed which provides a chance for us to optimize network in application level rather than individual flow. In this paper, we propose a coflow-aware routing algorithm which using Simulated Annealing method to reduce the average completion time of coflow requests. We also implement our algorithm in SDN-based networks to achieve dynamic routing. The experimented results in our research will show our coflow routing algorithm can achieve better performance than other existing solutions.