Performance Analysis for Constraint Based WDM Networks using Modified DWP Algorithm

In this paper a new approach to constraint-based path selection for dynamic routing and wavelength allocation in optical networks based on Wavelength Division Multiplexing (WDM) is proposed. The Distributed discovery wavelength path selection algorithm (DWP) proposed in the past takes longer time to select a path even though it is able to solve some conflicting constraint imposed by electronic regenerators. In this work the DWP algorithm has been refined and Modified DWP (MDWP) has been proposed. The proposed algorithm takes a lesser amount of time to select a path and also preserves the advantage of overcoming the conflicting constraints imposed by electronic regenerators. The effectiveness of the proposed approach has been verified through analytical and simulated results for a well known 21 node ARPANET and the approach is shown to effectively accommodate multiple constraints and results reveal that MDWP algorithm converges quickly compared to the DWP algorithm and also provide lesser blocking probability.