By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Markovic, G.Z. ; Fac. of Traffic & Transp. Eng., Belgrade ; Acimovic-Raspopovic, V.S. ; Teodorovic, D.B.

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.

Published in:

Telecommunications in Modern Satellite, Cable and Broadcasting Services, 2007. TELSIKS 2007. 8th International Conference on

Date of Conference:

26-28 Sept. 2007