By Topic

Applying ant colony optimization to routing in optical multistage interconnection networks with limited crosstalk

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

4 Author(s)
Katangur, A.K. ; Dept. of Comput. Sci., Georgia State Univ., Atlanta, GA, USA ; Akkaladevi, S. ; Yi Pan ; Fraser, M.D.

Summary form only given. Ant colony optimization (ACO) technique can be successfully implemented to solve many combinatorial optimization problems. In this paper we use the ACO technique to route messages through an N×N optical multistage interconnection network (OMIN) allowing up to 'C' limited crosstalk's (conflicts between messages within a switch) where 'C' is a technology driven parameter and is always less than log2N. Messages with switch conflicts satisfying the crosstalk constraint are allowed to pass in the same group, but if there is any link conflict, then messages are routed in a different group. The focus here is to minimize the number of passes required for routing allowing up to 'C' limited crosstalks in an N×N OMIN. In this paper we show how the ACO technique can be applied to the routing problem, and its performance is compared to that of the degree-descending algorithm using simulation techniques. Finally the lower bound estimate on the minimum number of passes required is calculated and compared to the results obtained using the two algorithms discussed. The results obtained show that the ACO technique performs better than the degree-descending algorithm and is quite close to optimal algorithms to the problem.

Published in:

Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International

Date of Conference:

26-30 April 2004