By Topic

Genetic algorithm for optimal design of delay bounded WDM multicast 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)
Jeyakumar, A.E. ; Gov. Coll. of Technol., Coimbatore, India ; Baskaran, K. ; Sumathy, V.

Multicast is an efficient way to distribute information from single source to multiple destination as well as many to many [Dr. A. Ebenezer Jeyakumar et al., Jan. 2003]. This paper shows the problem of real time delay bounded multicasting in wavelength division multiplexing network to avoid problem of synchronization between video and audio frames. This work describes a genetic algorithm based technique to synthesize wavelength division multiplexing (WDM) network topologies that can, with a high degree of confidence, assure that the multicast traffic is delivered in user specified limits on time. Unlike existing approaches to WDM network design, we first find a virtual topology that can meet the delay constraints. An embedding of virtual rings into physical links is then carried out, followed by an assignment of wavelengths to virtual links. The problem of finding the virtual topology is difficult because of a large number of parameters. A number of heuristic approaches have been proposed to solve such optimization problems. In this approach, the main aim is to explore the suitability of genetic algorithms to solve the WDM network design problem. A genetic algorithm can explore a far greater range of potential solutions to a problem than do conventional approaches. The advantage of a genetic algorithm, compared with other algorithms, which use a initial guess, e.g. gradient, descent is to use more information of estimation region, and to decrease the probability of falling into local minimum. This paper describes quantitative and qualitative results obtained by using our software tool on several benchmark examples.

Published in:

TENCON 2003. Conference on Convergent Technologies for the Asia-Pacific Region  (Volume:3 )

Date of Conference:

15-17 Oct. 2003