Allocation of protection domains in dynamic WDM mesh networks

In this paper, we solve the survivable routing problem in dynamic WDM mesh networks under the framework of short leap shared protection (SLSP). A novel algorithm called cascaded diverse routing (CDR) is proposed. We also demonstrate a novel approach to solving the diverse routing problem in networks with dynamic traffic for the purpose of shared protection, called iterative two-step-approach (ITSA). Simulation is conducted using four different networks (22-, 30-, 79-, 100-node) for a comparison between ordinary shared protection schemes and the SLSP scheme. Simulation results show that the best performance can be achieved with well-designed diameter of protection domains for every connection request according to the size and topology of the network.