GMPLS中基于约束的分段保护算法

在总结、比较当前各种常见的GMPLS恢复保护机制性能的基础上,对多种路由算法思想进行了分析比较,并针对保护机制恢复时间、恢复机制的资源利用率,提出了基于约束的最短路径优先选择的改进算法.利用剪枝算法计算出一条具有约束条件的主路径,再结合LSP分段保护算法建立保护路径.由于保护路径比较短,因此能有效地节省资源,降低保护路径失败的概率,更快地激活保护路径,保证了可靠性.

Constraint-based subsection protection algorithm on in GMPLS

After comparing various familiar GMPLS instauration protection mechanism and analysising various routing algorithm ideas,we aim at the protection instauration time and the using of instauration resource rate,put forward a kind of improvement of the constraint-based shortest path first algorithm and the in GMPLS network.Using the A*Prune algorithm to set up a constraint-based main path,and the LSP span protection is used to build a secande path.The protection path is shorter,so can availably save resources,l...