基于约束的GMPLS恢复算法.pdfVIP

第34 卷 第1 期 电 子 科 技 大 学 学 报 Vol.34 No.1 2005 年2 月 Journal of UEST of China Feb. 2005 基于约束的GMPLS恢复算法 1 2 赵季红 ，曲 桦 (1. 西北工业大学计算机系 西安 710072; 2. 西安交通大学电信学院 西安 710061) 【摘要】在分析与恢复技术有关的GMPLS技术特性基础上，提出了一种基于约束的GMPLS恢复算法(CGR) ， 并对相关的约束条件的设置做了具体的规定和说明，以网状网为例，详细介绍了所提出算法的实现方法和特点。 该算法借鉴了传统恢复技术的优点，又充分考虑到GMPLS 网的特性，使其具有继承性和兼容性。 关 键 词 通用多协议标签交换; 标签交换路径; 生存性; 恢复 中图分类号 TP311 文献标识码 A GMPLS Recovery Algorithm Based on Constrained ZHAO Ji-hong Qu HUA (1. Computer Department, Northwestern Polytechnical University Xi’an 710072; 2. Telecomunication College, Xi’an Jiaotong University Xi’an 710061) Abstract 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. Key words generalized multi-protocol label switching