2005International Conference on Artificial Intelligence and Soft ComputingRequires access

Wavelength Routing in Future WDM Networks

Krešimir Lukač, Zrinka Lukač, Mladen Tkalić

Open publisher page 1 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Routing and wavelength assignment, Blocking (statistics), Wavelength-division multiplexing, Computer science, Routing (electronic design automation), Traffic grooming, Heuristic, Computer network

Related papers

Back to paper searchBrowse research topicsOriginal source
Wavelength Routing in Future WDM Networks — Research Paper | ScholarLens