A tie-set based approach of Software-Defined Networking for traffic load balancing

This paper proposes a traffic Load Balancing (LB) method to alleviate load concentrations on links for large-scale networks. In this paper, the traffic LB problem is formulated in a graph with unsplittable multi-commodity flows which have fixed attributes and pairs of source and destination. The proposed method calculates combinations of routes that minimize the load factor for each ring structures on a network. Balancing of link load factor in a whole network is achieved by repeating the process of minimization method for each ring structure. Our simulation results show that this method is more effective for larger graphs in terms of the balancing performance. The convergence of this algorithm is also demonstrated empirically.