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

光传送网是电信网的基础，如何在网络发生故障后将受故障影响的业务快速恢复，是光网络面临的重要问题．本文在分析了经典Floyd算法和Dijsktra算法存在的问题的基础上，提出了一种备用路径和搜索算法相结合的恢复算法，且在搜索算法中提出了一种快速不完全遍历算法（FIE算法），该算法适合于网状网结构．当网络发生故障后，首先查找备用路径，在备用路径无法恢复的情况下，以一定的准则进行路径的搜索，并采用双向搜索的方式，从多方面大大缩短了恢复时间．

Fast Restoration Route Hunting Algorithm for Optical Networks

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.