基于约束的GMPLS恢复算法  

GMPLS Recovery Algorithm Based on Constrained

作　　者：赵季红[1] 曲桦[2] 

机构地区：[1]西北工业大学计算机系,西安710072 [2]西安交通大学电信学院,西安710061

出　　处：《电子科技大学学报》2005年第1期101-104,共4页Journal of University of Electronic Science and Technology of China

基　　金：国家自然科学基金资助项目(60072051);国家863计划资助项目(2001AA121072)

摘　　要：在分析与恢复技术有关的GMPLS技术特性基础上,提出了一种基于约束的GMPLS恢复算法(CGR),并对相关的约束条件的设置做了具体的规定和说明,以网状网为例,详细介绍了所提出算法的实现方法和特点。该算法借鉴了传统恢复技术的优点,又充分考虑到GMPLS网的特性,使其具有继承性和兼容性。GMPLS is the nucleus of next generation network technology. The research on the restoration method for the GMPLS are mostly using the concept of traditional method, but the features of GMPLS about recovery technology make the restoration method has some special requirements. In this paper, we first discuss some problems, which occur in GMPLS’s fault recovery. Based on this, the article proposes a new GMPLS recovery algorithm based on constrained (CGR), and describes how to set the constrain conditions. We apply this algorithm in mesh network and give the implement and feature. These methods draw on the experience of the traditional recovery techniques and also fully consider the properties in GMPLS, so make it successable and compatible.

关 键 词：通用多协议标签交换 标签交换路径 生存性 恢复 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]