2007•Unpublished venueRequires access

An Application of Heuristic Algorithm Based on Route Minimum Cost for RWA in All-Optical WDM Networks

Goran Marković, Vladanka S. Aćimović-Raspopović, Dušan Teodorović

Abstract

In this paper a heuristic algorithm based on alternate routing approach that considers jointly every route-wavelength pair in order to choose one with a minimum cost to establish a lightpath is applied for solving the RWA (routing and wavelength assignment) problem in optical WDM (wavelength division multiplexing) network in a case of dynamic traffic demands. We performed numerous simulations to obtain and analyse the blocking probability performance of this algorithm. The programme code we developed for simulation can be efficiently applied for various network topologies as well as for various traffic demands, number of wavelengths and number of alternate routes in a given network.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 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

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