By Topic

A new fitness function for GA-based dynamic RWA algorithms in 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
$33 $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

4 Author(s)
Vinh Trong Le ; Sch. of Inf. Sci., JAIST, Ishikawa, Japan ; Xiaohong Jiang ; S. Horiguchi ; Y. Inoguchi

Genetic algorithms (GA) provide an attractive approach to solving the challenging problem of dynamic routing and wavelength assignment (RWA) in optical wavelength division multiplexing (WDM) networks, with the aim of achieving a significantly low blocking probability. However, available GA-based dynamic RWA algorithms were designed mainly for WDM networks with the wavelength continuity constraint, and they cannot be applied directly to WDM networks with wavelength conversion capability. In this paper, we study the dynamic RWA problem in both optical WDM networks without wavelength conversion and in optical WDM networks with sparse wavelength conversion. By introducing a new fitness function, which is based on the combination of the shortest available path (SAP) and least congested path (LCP) schemes, the GA-based dynamic RWA algorithms can be applied to both these networks and achieve a significantly lower blocking probability than the conventional RWA algorithms. This is verified by extensive simulation studies on the ns-2 network simulator.

Published in:

2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic  (Volume:2 )

Date of Conference:

16-18 Nov. 2005