Multi-constraint QoS disjoint multipath routing in SDN

Efficient path computation and sustaining quality of service requirements are key networking concerns. Modern networks have turned to multipath routing schemes to split flows across multiple paths. However existing solutions still result in sub flows being directed to the same paths. QoS routing as well poses major challenges due to the complexity of multi objective path optimization and handling connection requests ensuring that all the requirements are fulfilled. Software defined networks (SDN) have proved to be efficient in overcoming these limitations with their centralized control of the network. In this paper we propose a two-phase procedure for obtaining k-max min QoS disjoint paths combined with the analytic hierarchy process in an SDN environment.