多约束路由的简单求解方法  

Simple idea upon multi-constrained QoS routing

作　　者：王宇[1] 许都[1] 王宏[1] 李乐民[1] 

机构地区：[1]电子科技大学光纤通信实验室,成都610054

出　　处：《计算机应用研究》2007年第11期268-270,277,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(60372011)

摘　　要：已有多约束路由问题的算法都相当复杂,其步骤多、处理开销大,这些都会给QoS的实际应用带来很大的限制。ATC(additive-to-concave)算法把加性参数转换为瓶颈性参数,使用直观、简单的方法找到从源点到终点的路径。该方法是QoS多约束路由问题算法中最简单的方法,并且性能较好。Varied algorithms have been presented on multi-constrained QoS routing, but their comPutational complexities are all high. Among existing heuristic algorithms, ATC is the simplest way to solve multi-constrained QoS routing problem. It transforms additive metrics to concave metrics, so routing becomes easier, computational complexity takes less, routing and its steps＇ cost become less and the application of QoS routing becomes more convenient and practicable.

关 键 词：服务质量参数 服务质量路由 多约束服务质量路由 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]