格网中p-cycles重配置的快速实现算法  

A fast algorithm of reconfigurable p-cycles in mesh network

作　　者：侯林[1] 周煜[1] 顾畹仪[1] 

机构地区：[1]北京邮电大学光通信与光波技术教育部重点实验室,北京100876

出　　处：《高技术通讯》2007年第8期789-792,共4页Chinese High Technology Letters

基　　金：863计划（2006AA01Z246）、国家自然科学基金（60602004）和教育部新世纪优秀人才支持计划（NCET-05-0112）资助项目.

摘　　要：提出了一种用于双链路故障恢复和为动态业务提供保护的p-cycles重配置启发式算法.该算法可以提供网络生存性设计和网络管理的高效性和简洁性,并能提供快速的恢复操作.仿真结果表明,这种算法用于双链路故障恢复的重配置容量冗余度可达74%,平均计算时间为48ms;用于增量重配置的双故障冗余度为118%,计算时间为81ms.基于该算法的业务恢复可以满足大多数业务的最低可中断时间要求.分析表明该算法亦适用于动态业务的p-cycles重配置.This paper proposes a heuristic algorithm of reconfigurable p-cycles for the restoration of dual hnk failure and the protection of dynamic services. The proposed method can provide the high efficiency and simplicity for survivable network design and management, and fast runtime recovery operation. The simulation results show that the proposed method needs an average spare capacity redundancy of 74% and average calculating time of 48ms for the reconfiguration of recovery of dual link failure, and it needs an average of 118% and 81ms for the incremental reconfiguration, while the speed of restoration would not jeopardize many services. The conclusions show that the algorithm is also adapted to the reconfiguration of p-cycles of dynamic services.

关 键 词：P-CYCLES 重配置 快速 算法 

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