By Topic

Evolutionary approach for message scheduling in optical Omega 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)
Yi Pan ; Dept. of Comput. Sci., Georgia State Univ., Atlanta, GA, USA ; Chunyan Ji ; Xiaola Lin ; Xiaohua Jia

Optimal routing in optical Omega network is an NP-hard problem and traditional heuristics have only limited success in solving small to midsize routing problems. In this paper, we explore the possibility of using genetic algorithm (GA) to optimize a routing solution on optical Omega networks, and determine the impact of various factors, specifically the impact of crossover probability, mutation probability, and population size on GA's performance. We use different operators and parameters of GA to test their impact on the performance of the algorithm and obtain a good range for each parameter. To compare the performance of the GA to other existing heuristic routing algorithms, many cases are tested and the results are analyzed. The results indicate that the genetic algorithm can reduce the number of passes to send messages on an optical Omega network without crosswalk.

Published in:

Algorithms and Architectures for Parallel Processing, 2002. Proceedings. Fifth International Conference on

Date of Conference:

23-25 Oct. 2002