An Algorithm for Dynamic Routing and Wavelength Assignment in WDM Network

In WDM network, it is still a core issue to research routing. According to the characteristics of multi wavelength optical network and the setting of the wavelength converter, we change multi wavelength network to single wavelength dynamic network through the conversion function of wavelength converter, and put forward an equivalent model of degree-constrained shortest path calculation. Through the analysis of the model, we use the method of adding the critical point set and adding the virtual node, put forward an improved algorithm based on the the Dijkstra shortest path algorithm. The time complexity of the Dijkstra algorithm is O(n(5)), and that of the improved algorithm is O(n(3)). The time complexity reduces greatly. This improved algorithm can allocate network resource more reasonably, improve the utilization rate of load-balanced links, and save the time of data transmission and the resource of link.