WDM疏导网络中的子通路保护算法

Sub-path Protection Algorithms in WDM Grooming Networks

研究了WDM疏导网络的生存性问题,提出一种基于共享风险链路组(SRLG)限制的共享子通路保护算法·该算法将业务连接的工作通路分为互不重叠的等长子通路,分别找出它们SRLG分离的保护通路,并且允许共享保护资源·仿真研究表明:该算法既保证了业务连接的可靠性要求,同时又提高了全网资源利用率·另外,它允许网络管理者根据不同优化指标调整子通路的长度,从而可以在恢复时间和资源利用率之间进行折中·

The problem of dynamically establishing dependable connections in wavelength division multiplexing (WDM) mesh networks with traffic grooming capabilities was investigated. A disjoint routing scheme under shared risk link groups (SRLG) constraints was proposed. It was called multigranularity shared subpath protection (MSSP) scheme. The scheme searches a primary path for each connection request firstly,and then segments the path into several equal length subpaths, and calculates their SRLGdisjoint backup paths. In order to obtain the optimal spare capacity, MSSP makes use of the backup multiplexing technology to share backup bandwidth among different backup paths if their corresponding primary subpaths are SRLGdisjoint. Based on dynamic traffic with different load,the performance of MSSP was investigated via simulations. MSSP can improve the performance of the network significantly and make the tradeoffs between the resource utilization and recovery times.