Shared sub-path protection algorithm for WDM mesh networks with traffic grooming capabilities

This paper investigates the problem of dynamically establishing dependable connections in traffic-grooming wavelength division multiplexing (WDM) mesh networks, and proposes a dynamic shared sub-path protection (SSPP) scheme for multi-granularity traffic. To establish a dependable connection, SSPP first searches a primary path for each connection request, and then it segments the found path into several equal-length sub-paths, and computes their corresponding backup paths, respectively. In SSPP, if two sub-paths are fiber-disjoint then their backup paths can share backup resources to obtain the optimal spare capacity. Based on dynamic traffic with different load, the performance of SSPP has been investigated via simulations. The results show that SSPP can make the tradeoffs between the resource utilization and the restoration time.