A relaxing multi-constraint routing algorithm by considering QoS metrics priority for wired network

To find a path satisfying multi-constrained QoS metrics in packet switching network is a very challenging problem. The problem of finding such feasible paths is known as an NP-complete problem. In this work, we propose a solution to the afore-mentioned problem by relaxing the multi-constrained QoS routing using the significance level of QoS metrics. Our proposed algorithm adopts the nonlinear cost function and relaxing look-ahead concept: to put into account the QoS metrics´ priority. The performance of our proposed algorithm is evaluated by simulation using MATLAB in terms of Success Ratio of finding the feasible paths and Computational Complexity. According to the simulation results, it is obvious that our proposed algorithm is superior to the existing algorithm (H_MCOP) in terms of Success Ratio, but inferior in terms of Computational Complexity. However, the Computational Complexity of our proposed algorithm is still within the acceptable level (1-2 ms for 100-node network).