A p-cycle based survivable design for dynamic traffic in WDM networks

Achieving both high capacity efficiency and fast restoration speed is a primary goal of survivable design in WDM network. The p-cycle method aims to benefit from the fast restoration of ring-like protection and high capacity efficiency of mesh protection. In this paper, we first present a p-cycle based method to deal with dynamic traffic in survivable WDM network design. In this method, we first find an optimal set of p-cycles for the given network topology. Next, we propose three routing strategies for accommodating dynamic requests upon their arrival time. The performance of our p-cycle based design using different routing strategies are compared with that of the shared backup path protection (SBPP). The results show that proposed p-cycle based design method performs better than SBPP in dense networks. Whereas SBPP performs better than the p-cycle based design in sparse networks.