A QoS Routing Algorithm Based on Pareto Optimal
基于Pareto最优的QoS路由算法

A novel unicast QoS routing algorithm is proposed to address the two additive constraints routing problem. The algorithm is based on the concept of Pareto optimal and dynamic weight coefficient mechanism. Normally to attain a high performance, the algorithm only needs to run 2~3 times of the Dijkstra algorithm. Extensive simulations have shown that the algorithm is very efficient and converges quickly.