A New Approach to the Provision of Non-simple Node-Protecting p-Cycles in WDM Mesh Networks

This paper proposed a new approach to the provision of nonsimple node-protecting p-cycles in survivable WDM mesh networks. The traditional designs of non-simple p-cycles model the problem as an Integer Linear Program (ILP), and require the pre-enumeration of all possible p-cycles. The resulting ILP becomes less tractable for a large network because there may exist a huge number of p-cycles. We proposed a new solution method using large scale optimization tools, i.e., Column Generation (CG). With CG, p-cycles are generated dynamically when needed. Numerical results show clearly that our new proposed method has a big advantage over the existing one in the capacity efficiency.