Rwa Problem In Wdm Optical Network, Dynamic Business

Routing and Wavelength Assignment (RWA) problems under dynamic traffic circumstance in wavelength division multiplexing network are studied in this paper. Two novel RWA algorithms are proposed. One is based on alternated routing;the other is based on adaptive routing. The architecture of the simulation based on C language and the program flowcharts are also proposed.As for the alternated RWA algorithm, based on the study of a traditional k-shortest path RWA algorithm, considering its disadvantages, a novel algorithm which satisfies the hops constraint named delta-hops algorithm is developed. With the network blocking probability, success rate for searching path and searching time for each selected path being the main research object, a simulation based on C language in Microsoft Visual C++ 6.0 for these two alternated RWA algorithms are taken. The simulation results show that delta-hops algorithm performs better than the traditional k-shortest path algorithm in large-scale and heavy load network.As for the adaptive RWA algorithm, based on the study of the Adaptive Dynamic Min-Hops (ADMH) RWA algorithm, considering the its disadvantages, we propose a novel algorithm which is based on priority named Priority Adaptive Dynamic Min-Hops (PADMH) RWA algorithm. With the network blocking probability being the main research object, a simulation based on C language in Microsoft Visual C++ 6.0 for these tow adaptive RWA algorithms are taken. The simulation results show that PADMH RWA algorithm performs better than the ADMH RWA algorithm in the muti-fiber and heavy load network.