2006PolyPublie (École Polytechnique de Montréal)Requires access

An Algorithm for Solving the Max-RWA Problem in Wide All-Optical WDM Networks

Abdellah Zyane, Samuel Pierre, Zouhair Guennoun

Open publisher page 0 citations

Abstract

This paper proposes a new approach for routing and wavelength assignment in wide all-optical WDM networks with wavelength continuity constraint. Given a number of available wavelengths on each optical fiber, we seek to maximize the number of satisfied requests for connections. This is known as Max-RWA problem. In our approach, called MLL (RWA with Minimum Loaded Link), the routing is based on the search for the optimal path while trying to minimize the load on the links of the network in order to minimize the links' capacity and then minimize the utilization of the network links. The wavelength assignment is based on a graphs coloring method using tabu-search. We tested our algorithm on known networks like the EONNET and NSFNET. Generally, our results are better with those provided by the existing solving approaches taken as reference.

About this research paper

What this paper is about

This paper proposes a new approach for routing and wavelength assignment in wide all-optical WDM networks with wavelength continuity constraint. Given a number of available wavelengths on each optical fiber, we seek to maximize the number of satisfied requests for connections. This is known as Max-RWA problem. In our approach, called MLL (RWA with Minimum Loaded Link), the routing is based on the search for the optimal path while trying to minimize the load on the links of the network in order to minimize the links' capacity and then minimize the utilization of the network links. The wavelength assignment is based on a graphs coloring method using tabu-search. We tested our algorithm on known networks like the EONNET and NSFNET. Generally, our results are better with those provided by the existing solving approaches taken as reference.

Why it matters

A significance statement is not available in the OpenAlex record.

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

This paper proposes a new approach for routing and wavelength assignment in wide all-optical WDM networks with wavelength continuity constraint. Given a number of available wavelengths on each optical fiber, we seek to maximize the number of satisfied requests for connections. This is known as Max-RWA problem. In our approach, called MLL (RWA with Minimum Loaded Link), the routing is based on the search for the optimal path while trying to minimize the load on the links of the network in order to minimize the links' capacity and then minimize the utilization of the network links. The wavelength assignment is based on a graphs coloring method using tabu-search. We tested our algorithm on known networks like the EONNET and NSFNET. Generally, our results are better with those provided by the existing solving approaches taken as reference.

Key concepts: Routing and wavelength assignment, Wavelength-division multiplexing, Tabu search, Computer science, Routing (electronic design automation), Path (computing), Mathematical optimization, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
An Algorithm for Solving the Max-RWA Problem in Wide All-Optical WDM Networks — Research Paper | ScholarLens