Constraint-Based Rerouting mechanism to address Congestion in Software Defined Networks

In this paper, we propose a traffic rerouting mechanism to address congestion in Software-Defined networks. We employ back-tracking and constraint propagation techniques to find alternate paths to reroute multiple active flows simultaneously. Cost function is based on standard deviation of link-loads. We then compare traffic distribution and link utilisation with and without rerouting active flows. We measure and compare network performance using parameters such as total rate of transfer, jitter, and packet loss with that of Shortest Path First with no rerouting. Our proposed solution produces lower jitter, packet drops, and higher transfer rate. We finally conclude the paper by making observations and discussing the scope of the future work.