Dynamic Routing And Wavelength Assignment Algorithm Of WDM Optical Networks

In the wavelength-routed optical network, the number of channels of the network provides,which connects the source node to the destination node, is limited by the network source factorsin each of fiber link such as the number of reusable wavelengths, fibers and so on. Consideringvarious constraints in the network, the research on how to select the best routing and assign theappropriate wavelength resources for optical connection requests, in order to achieve the optimalperformance of overall network is quite important and essential. In this thesis, the dynamicrouting and wavelength assignment (RWA) and related problems are investigated.Firstly, a new kind of multi-factors comprehensive analysis of (MCA) RWA algorithm inthe network without wavelength converter is presented. On the basis of wavelength layeredgraph model, the impact of the distance of each link, the number of reusable fibers in the link,the total number of available wavelengths on the network connectivity is analyzed. Theadaptation strategies for the first time were used in the wavelength selection of MCA algorithm.By simulation, it can be seen that the network congestion is reduced in the novel algorithm.Secondly, the MCA algorithm is improved, which is called priority multi-factorscomprehensive analysis (PMCA) algorithm. The advantage of PMCA is that, the wavelengthselection strategy is based on priority, so that the network traffic can be better balanced. Bysimulation, it can be seen that the PMCA algorithm is superior to the MCA algorithm with thereduction of network congestion.Finally, the configuration of wavelength converter in dynamic RWA network withwavelength converter is analyzed. With the improvement of"sub-graph + ADD"algorithm, the"sub-graph + node weights sorting (NWS)"algorithm is achieved. By simulation, it can be seenthat the computational complexity is decreased effectively with the assurance of accuracy of theresults.