Framework of spare capacity re-allocation with S-SLSP for mesh WDM networks

This paper focuses on solving the problem of spare capacity re-allocation in WDM mesh networks with dynamic traffic. Based on the framework of short leap shared protection (SLSP), an approach called static SLSP (S-SLSP) for achieving optimal deployment of spare capacity is introduced. Optimization is conducted in an interleaved manner according to topological distribution and the restoration speed requirement of each working path in order to initiate a compromise between computation time and quality of spare capacity reallocation. Simulation is conducted on four networks with different topology, which examines the S-SLSP algorithm by deriving the best mileage (in hops) in each subset of working paths to be optimized together.