The Research Based On Routing And Wavelength Resource Distribution Technology In ASON

Recent years, as the appearing of mobile intelligent terminals, the data traffic grows exponentially, which demands higher requirements of the function of the traditional optical transport network. In the case of optical network technology updates more quickly, ASON(Auto Switch Optical Network) technology has been developed. ASON technology is an intelligent optical network which could complete the automatic switching optical network connections under the control of signaling network and has the ability of dynamic configuration with resource-demand. The core of the technology is to add a control plane in the optical transport network,which could achieve distribution according to need of the network resources and optimize the use of WDM network wavelength resources to achieve the intelligent optical network.It is a breakthrough of the intelligent optical network and has been a hot issue in research.RWA (routing and wavelength assignment) problem is one of the essential technology of the ASON.RWA problem can be divided into sub-problems and wavelength routing sub-problem,any one could affect the performance of the entire network. This paper presents two new routing algorithm,one is to add dynamic weight function in Dijkstra algorithm to change the weights of the link in real-time,One is to add a link selection control factor in the traditional ant algorithm,both affect the final path that the algorithm chooses,so as to make the load of the network more balanced and the block rate of the network lower.This article focuses on the research of the routing and wavelength allocation key technology in the ASON.The main results of the work are as follows:(1) ASON technology and routing and wavelength allocation technologyThis part lays a foundation to the subsequent algorithm research. Since this study is based on ASON network routing and wavelength resource allocation techniques,it is necessary to make theoretical research and analysis of the routing and wavelength assignment technology. ASON section introduces the status of the application stage, consisting of architecture, application characteristics and key technologies. Routing and wavelength assignment problem divides into two sub-problems of routing and wavelength assignment and analyses the advantages and disadvantages of the existed algorithm to pave the way for thesubsequent simulation studies.(2) Routing and wavelength assignment problem based on improved Dijkstra algorithmThis paper completed theory analysis and simulation of the improved Dijkstra algorithm based on dynamic weights. Its main innovation is to add dynamic function weight in the traditional Dijkstra algorithm.Weight of the link is not fixed,it changes with the change of channel utilization,so the load of the network will be more balanced.Then we make simulation to the algorithm, build a simulation plat form, compare the network performance of the traditional Dijkstra algorithm and the Dijkstra algorithm added dynamic function weight.The simulation result shows that, under the same conditions,compared to traditional Dijkstra algorithm, the Dijkstra algorithm added dynamic function weight has less network congestion rate, higher link utilization, so the algorithm is designed to meet.(3) Routing and wavelength assignment problem based on improved ant algorithmThis article completed the theoretical analysis and simulation study of the routing and wavelength assignment problem based on improved ant algorithm. Adding link control factor in the traditional ant algorithm transition probability function,so when the ants choose the path, consider not only how many pheromones, but also consider the channel utilization on the path.In this way could we change the way ants choose the path, reduce network blocking rate and enhance the performance of routing and wavelength assignment algorithm. The simulation results show that, compared to the traditional ant algorithm. The improved ant algorithm could reduce network blocking rate. So the algorithm is designed to meet.