Multi-constraint qos disjoint multipath routing in SDN

Abstract

Efficient path computation that sustains varying quality of service requirements is a key networking concern. Even though modern networks turned to multipath routing schemes as a first step in this path, existing solutions still resulted in sub-flows being directed to the same paths. Moreover, maintaining the quality of service subject to multiple criterions while selecting the paths and handling connection requests dynamically has proved to be challenging tasks. Addressing all these issues requires a centralized, real-time- and fine-grained control of the network facilitated by Software Defined Networks (SDN) that have emerged as a revolutionary networking paradigm. In this paper, we deal with the former issue by computing k-max min disjoint paths and for the latter we use an analytic hierarchy process. The proposed solution combines the two approaches for deployment in an SDN environment.