一种WDM光网络中的递归式子通路保护算法

研究了具有抗毁性能的波分复用光网络中的子通路保护路由算法问题,提出了一种递归式子通路保护算法,目的在于引入一种更为灵活有效的方法来对工作通路进行分段,并为各个工作子通路计算相应的保护子通路,算法中采用了递归的思想来计算工作子通路和保护子通路．相比传统的等分子通路保护算法,该算法能够在故障恢复时间和波长资源利用率两者之间取得更好的折衷。

A Novel Recursive Shared Segment Protection Algorithm in Survivable WDM Networks

This paper investigates the problem of dynamic survivable routing for Shared Segment Protection in mesh wavelength-division-multiplexing (WDM) optical networks. We propose a heuristic algorithm, named Recursive Shared Segment Protection, to introduce a more flexible way to partition the working path into segments and compute the corresponding backup segments. We adopt a recursive process to compute the backup segments one by one and then choose an optimized way to partition the working path. Compared with the traditional equal-length segment protection algorithm, our proposed algorithm can achieve better compromise between the failure recovery time and the bandwidth resource utilization ratio.