%0 Journal Article
%T Precomputation for Multi-Constrained QoS Routing in GMPLS Networks<br>GMPLS网络中多约束QoS路由的预计算方法
%A HUA Yu
%A WU Chan-Le
%A WANG Yong
%A <br>华宇
%A 吴产乐
%A 王勇
%J 软件学报
%D 2006
%I 
%X Multi-Constrained QoS routing in GMPLS (generalized multiprotocol label switching) network is to find an optimal path satisfying several constraints, such as bandwidth, cost and delay. The problem has been considered as a NP-Complete problem. Based on SRLG heuristic information, the paper provides a MPAS algorithm (Multi-constrained Precomputation Algorithm with SRLG), which includes the precomputation and searching procedures. The precomputation i s able to create and update the routing tables in each node. Then, the searching procedure can select an optimal path satisfying several constraints in the hierarchical architecture. The results of extensive simulation based on the self-similar traffic show that the corresponding methods can achieve satisfactory performance and efficiently solve the problem of multi -constrained QoS routing in GMPLS network.
%K QoS routing
%K precomputation
%K GMPLS
%K hierarchical networks
%K NP-complete<br>QoS路由
%K 预计算
%K 通用的多协议标记交换
%K 层次化网络
%K NP完全
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=08473A7FF2E9EBDA&yid=37904DC365DD7266&vid=BCA2697F357F2001&iid=CA4FD0336C81A37A&sid=ED01F5AE50BE09C0&eid=0584DB487B4581F4&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=13