Towards link-disjoint paths under multiple additive QoS constraints

Finding disjoint paths between a source and destination node pair under quality of service (QoS) constraints is a significant scheme for improving both the network survivability and the QoS performances. This paper proposed a new algorithm, which aims to find a pair of link-disjoint paths that each of them satisfies two or more additive constraints. Our algorithm is on the basis of SAMCRA [1][2] and searches solutions according to the varied composition forms of the exact solutions. Comparisons and simulations show that our scheme is capable of getting feasible solutions and optimal solutions with higher probabilities than existing approaches.