Optimization of Semi-Dynamic Lightpath Rearrangements in a WDM Network

In this paper, we study the routing and wavelength assignment (RWA) problem in a semi-dynamic scenario where rearrangements are conducted in a series of sessions after traffic demands vary. Unlike pure static RWA problems, each rearrangement scheme must consider established lightpaths in the previous session. A novel formulation of the WDM network rearrangement problem is used to minimize rejected new demands and rerouted lightpaths. This is done by coordinating the re-routing of existing lightpaths with the adaptation to varying demands. The Lagrangean Relaxation and Subgradient Method (LRSM) has been successfully used to solve the problem along with fairness consideration. The superior performance and reduced computation complexity of our algorithm are demonstrated in sample networks. In addition, we evaluate the benefit of using wavelength converters in a WDM network rearrangement. In contrast to previous studies with conclusions that wavelength converters are of little value in the static RWA problem, we show that wavelength converters improve network performance in a WDM network rearrangement.