哈尔滨工程大学学报2011，Vol.32Issue(11)：1514-1517,4.DOI:10.3969/j.issn.1006-7043.2011.11.021
面向业务的GMPLS网络动态生存性算法
Service-oriented generalized multiprotocol label switching (GMPLS) dynamic survivability algorithm
摘要
Abstract
In order to study the network survivability of generalized multiprotocol label switching (GMPLS) , the network service uninterrupted problem was solved when the network was faulty. This paper first described the constrained shortest path first (CSPF) position and function of GMPLS, and then discussed the mathematical problems of the QoS routing description along with the concept of Shared Risk link Groups (SRLG). Next, based on the analysis and research from other routing algorithms, a new service-oriented dynamic survivability algorithm (SDSA) was proposed; compared with other survivability algorithms, when computing the protection path, the proposed algorithm not only considers different characteristics of the users'business, but also considers the SRLG factors. Both the realization process of an SDSA algorithm and a specific network simulation experiment were performed. The results verify the algorithm advantages in choosing alternative routes than other algorithms in respect of routing, hop count, and link utilization.关键词
流量工程/GMPLS/生存性/SDSAKey words
traffic engineering/ generalized multiprotocol label switching/ survivability/ service-oriented dynamic survivability algorithm分类
信息技术与安全科学引用本文复制引用
朱国晖,史浩山..面向业务的GMPLS网络动态生存性算法[J].哈尔滨工程大学学报,2011,32(11):1514-1517,4.基金项目
教育部博士点基金资助项目(20050699037) （20050699037）
