On approximate approaches to unsplittable flow edge load factor balancing problem

This paper discusses a method for leveling the traffic load of communication links in a distributed management network with multiple controllers. Our study has modeled the distributed management network as a flow network and defined the ratio of flow to capacity in an edge as a load factor. A flow optimization problem for finding the flow path to minimize the load factor in the entire network has been considered. By reformulating an unsplittable flow load factor balancing problem, our study has obtained that has been proven to be NP-hard and propose an approximate solution.