Multiple constraints QoS routing using priority metrics with control variables

To ensure the performance of Multi-Constrained Path (MCP) problem with respect to Quality of Service (QoS) requirements is NP-complete problem. The algorithm has to find the complete path from source to destination satisfying more than one constraint. This research aims to improve the performance of existing algorithm by assigning the appropriate priority to each link weight component. We use two main concepts which are nonlinear cost function and look-ahead concept in our modified algorithm. In the simulation, we use five different networks with two link-weight scenarios generated randomly from uniform and normal distributions. Then, we compare the results of success ratio (SR) and computational complexity as the performance measure. We found that our algorithm always gives a better performance in terms of SR than H_MCOP, but lesser performance in terms of computational complexity.