Algorithm for multi-constrained routing based on nonlinear path length
Suili Feng · Jisuanji yingyong yanjiu · 2008
The problem of finding a path that satisfies multiple constraints has been proved a NP-complete problem.Based on the analysis of some algorithms in this field,proposed an efficient multi-constrained routing algorithm.The new algorithm adopted the idea of nonlinear path length.In order to improve the success ratio,designed a dynamic path selection method for nodes,which demanded that nodes be relaxed for more times.For the reason of improving algorithm efficiently,added the concept of dominated path to the process of selecting more weights sum for path calculation.Large simulations prove that the new algorithm has high efficiency in success ratio and finding the shorter path.