Survivable routing with SLSP framework in dynamic optical networks

We solve the problem of protection domain allocation in dynamic WDM networks under the framework of short leap shared protection (SLSP). A novel survivable routing algorithm, namely dynamic SLSP (D-SLSP), is proposed, which contains two on-line algorithms: heavy fixed alternate routing (H-FAR) and cascaded diverse routing (CDR). A novel approach for deriving the link-state for solving the optimal protection path corresponding to a working path is given. A simulation is conducted using four different networks (22-, 30-, 79-, 100-node) for a comparative study between the ordinary shared protection schemes and the SLSP. Simulation results show that the best efficiency is achieved by using SLSP with a properly chosen diameter in each protection domain for every connection request, according to the size and topology of the network.