Poster: Network Performance Upgrade by Cut Spanners

In this paper, we introduce a new spanner algorithm which is based on computation of minimum cuts, and insertion of the edges crossing the cut to the spanner. The aim is to decrease the number of active links in the network while still maintaining the ability of the SDN (software defined networking) controller to perform load balancing. The spanner also can be used in order to reduce the running time of the SDN centralized routing algorithm to use. We present an algorithm to dynamically maintain the spanner under link insertion, deletion and changed weight. The analysis and simulation results show the superiority of our approach in many cases.