Abstract
Recently, SDN springs up and gradually plays an important role. In order to improve quality-of-service (QoS) in SDN, we focus on the fairness traffic engineering among all users. There exist researches that solve QoS problems. However, the algorithms used to solve the traditional network problems cannot be applied to the problems in SDN because of the limitation of ternary content addressable memory (TCAM). Therefore, we propose the maximum concurrent flow problem with bounded path degree, which is proved to be NP-hard, and then design a random-based path selection algorithm to solve it. Finally, we provide some experimental analyses and show that the performances of our algorithm are really great. i