Layered-graph Algorithm of Static Routing and Wavelength Assignment for Optical Networks
Han Hu
Abstract
Han Hu
Abstract
This paper puts forward a heuristic algorithm of Routing and Wavelength Assignment (RWA), which unifies the routing and wavelength assignment subproblems. Through a new Layergraph (LG) algorithm and limitative coefficientk,the routing and wavelength assignment of all optical networks can be optimized, which would make the required wavelengths the least for setting up opticalconnects. Finally the performance is studied by using some optical networks examples. It proves that this LG algorithm performs better than the existing ones.
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.
This paper puts forward a heuristic algorithm of Routing and Wavelength Assignment (RWA), which unifies the routing and wavelength assignment subproblems. Through a new Layergraph (LG) algorithm and limitative coefficientk,the routing and wavelength assignment of all optical networks can be optimized, which would make the required wavelengths the least for setting up opticalconnects. Finally the performance is studied by using some optical networks examples. It proves that this LG algorithm performs better than the existing ones.
Key concepts: Routing and wavelength assignment, Routing (electronic design automation), Computer science, Wavelength, Routing algorithm, Heuristic, Static routing, Algorithm