Wavelength Routing in Future WDM Networks
Krešimir Lukač, Zrinka Lukač, Mladen Tkalić
Abstract
Krešimir Lukač, Zrinka Lukač, Mladen Tkalić
Abstract
To build and scale new optical networks wavelength division multiplexing (WDM) promises to be one of the best solutions for both reliable wavelength transport and wavelength-level traffic engineering. However, the routing and wavelength assignment problem (RWA) arises. We attempt to minimize connection blocking using a heuristic approach based on the concept of learning automata which apply the idea of reinforcement learning. The blocking performance of the proposed model has been studied and compared with those of the fixed-alternate routing over all available wavelengths.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
To build and scale new optical networks wavelength division multiplexing (WDM) promises to be one of the best solutions for both reliable wavelength transport and wavelength-level traffic engineering. However, the routing and wavelength assignment problem (RWA) arises. We attempt to minimize connection blocking using a heuristic approach based on the concept of learning automata which apply the idea of reinforcement learning. The blocking performance of the proposed model has been studied and compared with those of the fixed-alternate routing over all available wavelengths.
Key concepts: Routing and wavelength assignment, Blocking (statistics), Wavelength-division multiplexing, Computer science, Routing (electronic design automation), Traffic grooming, Heuristic, Computer network