Traffic Grooming for Survivable WDM Mesh Networks under Shared-Risk-Link-Group Constraints
WDM网状网中基于共享风险链路组限制的业务量疏导算法

This paper addresses the dynamic establishment of dependable connections for grooming WDM mesh networks. A shared path-protection algorithm under Shared Risk Link Group(SRLG) constraints for multi-granularity traffic is proposed. The presented scheme establishes SRLG-disjoint primarily and backups traffic stream paths between the source-destination node pairs and reduces the spare capacity. It provides the same level of protection against single SRLG failure as dedicated path-protection scheme. Moreover it is better than dedicated path-protection scheme in network utilization. Network performance, based on dynamic traffic with different load, is investigated via simulations. The results show that the scheme can improve the performance of the network significantly.