Dynamic routing equivalent algorithm of multi-fiber multi-wavelength optical networks
Jie Li
Abstract
Jie Li
Abstract
In the paper, we propose a dynamic routing and wavelength assignment equivalent algorithm for multi-fiber multi-wavelength optical networks. We adopt a technique of wavelength graph, adding virtual source node and target node and introducing fiber numbers matrix. By doing so, the multi-wavelengths network is transformed to equivalent single-wavelength network and the complexity of program design of algorithm is greatly simplified. Based on the shortest path algorithm, for every call, optimal solution of routing and wavelength assignment in whole network can be gotten. The simulation results show that when calling capacity is 60, the blocking probabilities of 2 fibers and 4 fibers networks,which can convert all wavelengths, are respectively 0.1116, 4.3×10-5.
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, we propose a dynamic routing and wavelength assignment equivalent algorithm for multi-fiber multi-wavelength optical networks. We adopt a technique of wavelength graph, adding virtual source node and target node and introducing fiber numbers matrix. By doing so, the multi-wavelengths network is transformed to equivalent single-wavelength network and the complexity of program design of algorithm is greatly simplified. Based on the shortest path algorithm, for every call, optimal solution of routing and wavelength assignment in whole network can be gotten. The simulation results show that when calling capacity is 60, the blocking probabilities of 2 fibers and 4 fibers networks,which can convert all wavelengths, are respectively 0.1116, 4.3×10-5.
Key concepts: Computer science, Routing and wavelength assignment, Wavelength, Node (physics), Shortest path problem, Algorithm, Routing (electronic design automation), Static routing