Equivalent algorithm for dynamic routing in multi-wavelength optical network
Wei Xiao
Abstract
Wei Xiao
Abstract
In the paper, an equivalent algorithm for dynamic routing and wavelength assignment inmulti-wavelength optical network is proposed, for which a technique with wavelength graph and addingvirtual source node and destine node is adopted.By doing so, multi-wavelength network is transformedto equivalent single-wavelength network and two complicated problems of routing and wavelengthassignment are solved, and program design of the algorithm is simplified.By using a shortest pathalgorithm to solve the problem of routing and wavelength assignment,optimal solution can be derivedand the blocking probability of networks is efficiently decreased.Simulation results show that comparedwith FAR-2D algorithm, this equivalent algorithm can reduce the blocking probability by 0.02, 0.025respectively in 4- wavelength networks and in 8-wavelength networks
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In the paper, an equivalent algorithm for dynamic routing and wavelength assignment inmulti-wavelength optical network is proposed, for which a technique with wavelength graph and addingvirtual source node and destine node is adopted.By doing so, multi-wavelength network is transformedto equivalent single-wavelength network and two complicated problems of routing and wavelengthassignment are solved, and program design of the algorithm is simplified.By using a shortest pathalgorithm to solve the problem of routing and wavelength assignment,optimal solution can be derivedand the blocking probability of networks is efficiently decreased.Simulation results show that comparedwith FAR-2D algorithm, this equivalent algorithm can reduce the blocking probability by 0.02, 0.025respectively in 4- wavelength networks and in 8-wavelength networks
Key concepts: Blocking (statistics), Wavelength, Routing and wavelength assignment, Computer science, Node (physics), Routing (electronic design automation), Static routing, Algorithm