Multi-Path Routing and Wavelength Assignment (RWA) Algorithm for WDM Based Optical Networks

Abstract-In optical WDM networks, transmission of information along optical lines is advantageous since it has high transmission capacity, scalability, feasibility and also high reliability. But large amount of information is being carried; any problem during transmission can lead to severe damage to the data being carried. Hence it is essential to consider the routing as well as the wavelength assignment problems and then develop a combined solution for both the problems. In this paper, we propose to develop a routing and wavelength assignment algorithm for selecting the suitable alternate path for the data packets transmission. Two stages are based on the available bandwidth and the number of wavelength used in the link as construction of alternate paths, route and wavelength selection. In proposed work, Adaptive Routing and First-Fit Wavelength Assignment (AR-FFWA) algorithm to be used. For each pair of source and destination, the path with the minimum granularity values are selected as the primary path for data transmission, allocating the sufficient wavelength and the performances will be evaluated by using ns-2 simulation models. When we compared to existing system the overall blocking probability will be reduced to too low

IMPAIRMENT AWARE DYNAMIC ROUTING AND WAVELENGTH ASSIGNMENT IN WDM NETWORKS

Optical networks play a major role in supporting the traffic in backbone computer networks. Routing and Wavelength Assignment (RWA) is the technique used to establish a light-path from a source node to a destination node in a Wavelength Division Multiplexed (WDM) optical network. As an optical signal propagates through the network, the quality of the signal degrades due to physical layer impairments. To address this problem, in translucent WDM networks, the signal is regenerated at intervals. The main objective of this research is to propose a fast heuristic for dynamic lightpath allocation in translucent WDM networks and to compare the heuristic with an optimal algorithm that was proposed recently