计算机技术与发展2012，Vol.22Issue(4)：133-136,4.
基于多约束QoS路由算法综述
Overview of Multi-Constrained QoS Routing Algorithm
摘要
Abstract
With the development of the network techniques,real-time multimedia applications appear continuously. How to provide QoS guarantees for different QoS request and ensure the resources of network to be used efficiently is an important task of the current network. The solution of this problem is called multi-constrained optimal path ( MCOP). MCOP is a NPC problem. The algorithm for solving the problem can be classed such as exact, approximate and heuristic algorithms. It analyses the current algorithm as two classes: approximation algorithm and exact algorithm,and summarizes the advantages and disadvantages of these algorithms, then gives a prospect that how to make the existing multi-constrained routing algorithm to be more fast and more exact in future.关键词
多约束路由/QoS路由/精确算法/近似算法Key words
multi-constrained routing/ QoS routing/ exact algorithm approximate algorithm分类
信息技术与安全科学引用本文复制引用
韩贺,秦勇..基于多约束QoS路由算法综述[J].计算机技术与发展,2012,22(4):133-136,4.基金项目
广东省自然科学基金(05011896) （05011896）
