Computer Science – Networking and Internet Architecture
Scientific paper
2010-03-17
International Journal of Computer Networks & Communications 2.2 (2010) 119-130
Computer Science
Networking and Internet Architecture
12 Pages, IJCNC Journal 2010
Scientific paper
10.5121/ijcnc.2010.2209
We present an evolutionary programming algorithm for solving the dynamic routing and wavelength assignment (DRWA) problem in optical wavelength-division multiplexing (WDM) networks under wavelength continuity constraint. We assume an ideal physical channel and therefore neglect the blocking of connection requests due to the physical impairments. The problem formulation includes suitable constraints that enable the algorithm to balance the load among the individuals and thus results in a lower blocking probability and lower mean execution time than the existing bio-inspired algorithms available in the literature for the DRWA problems. Three types of wavelength assignment techniques, such as First fit, Random, and Round Robin wavelength assignment techniques have been investigated here. The ability to guarantee both low blocking probability without any wavelength converters and small delay makes the improved algorithm very attractive for current optical switching networks.
Bhanja Urmila
Mahapatra Sudipta
Roy Rajarshi
No associations
LandOfFree
A Novel Solution to the Dynamic Routing and Wavelength Assignment Problem in Transparent Optical Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Novel Solution to the Dynamic Routing and Wavelength Assignment Problem in Transparent Optical Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Novel Solution to the Dynamic Routing and Wavelength Assignment Problem in Transparent Optical Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-233561