面向业务的GMPLS网络动态生存性算法

摘要

为了研究GMPLS网络的生存性,解决网络故障后业务的不间断问题.文章在描述了CSPF在GMPLS中的位置和作用的前提下,讨论了QoS路由的数学描述问题和共享危机链路组(SRLG)的概念.在对路由算法的分析与研究的基础上,提出了一种新的面向业务的动态生存性算法-SDSA,较其他的生存性算法相比,该算法在计算保护路径时,不但考虑了用户业务的不同特征,同时也考虑了SRLG的因素.介绍了SDSA算法的具体实现过程,同时还通过一个具体的网络进行了仿真实验,验证了该算法在选择备用路由方面较其他算法在路由的跳数和链路利用率方面的优势.%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.