Paper Info
Title
A Novel Solution to the Dynamic Routing and Wavelength Assignment Problem in Transparent Optical Networks
Abstract
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.
Year
DOI
Venue
2010
10.5121/ijcnc.2010.2209
Clinical Orthopaedics and Related Research
Keywords
Field
DocType
evolutionary programming,optical switch,dynamic routing
Wavelength-division multiplexing,Optical switch,Computer science,Communication channel,Computer network,Assignment problem,Evolutionary programming,Adaptive routing,Multiplexing,Wavelength,Distributed computing
Journal
Volume
ISSN
Citations 
abs/1003.3
International Journal of Computer Networks & Communications 2.2 (2010) 119-130
2
PageRank 
References 
Authors
0.39
5
3
Name
Order
Citations
PageRank
Urmila Bhanja1276.52
Sudipta Mahapatra210215.77
Rajarshi Roy38018.39