Blocking Probability Reduction in WDM Networks Using Convertible Wavelength Assignment Techniques

Blocking probability has been one of the key performance in all wavelength routed optical Networks. Routing and Wavelength Assignment (RWA) scheme and a wavelength converter placement algorithm are considered to be the two primary mechanisms for improving the performance. Existing Research demonstrated a dynamic RWA scheme for determining a route in presence of wavelength conversion. This paper introduces a weighted least-congestion routing and first-fit wavelength assignment (WLCR-FF) RWA algorithm for routing and wavelength assignment will be done with the help of simple heuristic wavelength converter placement algorithm called Minimum Blocking Probability First (MBPF) that considers both the distribution of free wavelengths and the lengths of each route jointly. This result better than Dynamic RWA since it considers the hop count of each route and free wavelength distribution jointly. The performance of the proposed algorithm has been compared with a wide variety of existing routing algorithms including static routing, fixed- alternate routing and least-loaded routing algorithms. The result implies that the proposed algorithm can achieve much better blocking performance in the wavelength conversion.