GMPLS网络中多约束QoS路由的预计算方法.pdf

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software, Vol.17, No.1, January 2006, pp .167−174 http://www.j DOI: 10. 1360/jos170167 Tel/Fax : +86-10  2006 by Journal of Software. All rights reserved. ∗ GMPLS 网络中多约束QoS 路由的预计算方法 1+ 1 2 华 宇 , 吴产乐 , 王 勇 1(武汉大学 计算机学院,湖北 武汉 430079) 2( 朗讯科技 贝尔实验室中国基础科学研究院,北京 100080) Precomputation for Multi-Constrained QoS Routing in GMPLS Networks 1+ 1 2 HUA Yu , WU Chan-Le , WANG Yong 1(School of Computer, Wuhan University, Wuhan 430079, China) 2(Lucent Technologies, Bell Laboratory Research China, Beijing 100080, China) + Corresponding author: Phn: +86-013545256403, E-mail: yhuastar@ Hua Yu, Wu CL, Wang Y. Precomputation for multi-constrained QoS routing in GMPLS networks. Journal of Software, 2006,17(1):167−174. /1000-9825/17/167.htm Abstract: 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 is 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 achi