Method for Multi-constraint QoS Routing Problem Based on Lagrange Relaxation
基于拉格朗日松驰的多约束QoS路由算法

With the multi-constraint QoS routing algorithm, least cost QoS routing path satisfying two or more constrained conditions can be found based on Lagrange Relaxation. During this procedure, a method of overlap fit for network structure is proposed, thus the feasible path can be searched rapidly. This algorithm is a pseudo polynomial time algorithm, and comparing with the simulated results, the success rate of searching is not only related with the constraint number but also with the type of topology, and the more closer the network topology is to the real network, the more successful rate of searching reaches.