光网络的快速恢复路径搜索算法  

Fast Restoration Route Hunting Algorithm for Optical Networks

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

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

出　　处：《小型微型计算机系统》2006年第3期428-431,共4页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60472075)资助;国家高技术研究发展计划(八六三计划)项目(课题编号:2005AA121540)资助.

摘　　要：光传送网是电信网的基础,如何在网络发生故障后将受故障影响的业务快速恢复,是光网络面临的重要问题.本文在分析了经典Floyd算法和Dijsktra算法存在的问题的基础上,提出了一种备用路径和搜索算法相结合的恢复算法,且在搜索算法中提出了一种快速不完全遍历算法(FIE算法),该算法适合于网状网结构.当网络发生故障后,首先查找备用路径,在备用路径无法恢复的情况下,以一定的准则进行路径的搜索,并采用双向搜索的方式,从多方面大大缩短了恢复时间.We research on restoration route hunting method for WDM networks. Based on analyzing the classical Floyd and Dijsktra algorithm, we present a new restoration algorithm, which combines the route-backup and route-hunting algorithm. This method can be applied to mesh networks. As a fault being detected in the network, it searches the backup route first. If the affected services can not be restored completely, it will hunting another restoration routing with a certain principle in double direction. This method reduces the restoration time greatly.

关 键 词：光网络 路径选择 故障恢复 遍历 

分 类 号：TN913.24[电子电信—通信与信息系统]