Routing and Wavelength Assignment for Constraint Based Optical Networks Using Modified Dwp Algorithm

A new approach to constraint-based path selection for dynamic routing and wavelength allocation in optical networks based on Wavelength Division Multiplexing (WDM) has been proposed. The Distributed discovery wavelength path selection algorithm (DWP) proposed in the previous work takes a longer time for path selection even though it could solve some conflicting constraints imposed by electronic regenerators. The proposed work DWP algorithm has been refined and Enhanced (Modified) DWP . 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. Both the algorithms are compared in terms of blocking probability, convergence time and computational complexity. Results reveal that MDWP algorithm converges quickly compared to the DWP algorithm and also provide lesser blocking probability.