AN ALGORITHM OF ROUTING AND WAVELENGTH ASSIGNMENT IN THE TRANSPORT NETWORKS WITH WAVELENGTH DIVISION MULTIPLEXING
The paper reviews theoretical aspects of solving of a problem of routing and wavelength assignment (RWA) in the transport networks with wavelength division multiplexing. We propose an algorithm that accounts current occupation of spectral channels on the network segment and allows assigning two independent routes. We review the transport system model with wavelength division multiplexing in the form of interconnected reduced matrices.