启发式多约束路由算法研究

Research on Heuristic Multi-constrained Routing Algorithms

作为下一代互联网的核心问题之一,服务质量路由(QOSR)用来寻找一条同时满足多个约束条件的可行路径。多约束路由算法具有NPC的复杂度,研究者一般通过启发式算法来求近似解。对当前提出的各种单播启发式多约束路由算法进行了分析、比较,总结了各种算法的特点。最后指出了该领域需要进一步研究的热点问题。

QOSR（QOS Routing） is one of the key issues for next-generation networks,which seeks to find a feasible with multiple constraints.This problem have the complexity of NPC （NP c-omplete）,at generately,researchers design heuristic algorithms to gaining approximately solution.In this article,after typical heuristic algorithms on unicast multi-constrained routing are analyzed,the comparison and summary are given.At last,some key issues are pointed out to be further studied in the QOSR field.