By Topic

Efficient parallel routing algorithms in optical multistage interconnection network

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

3 Author(s)
M. Abdullah ; Dept. of Commun. Technol. & Network, Univ. Putra Malaysia, Selangor, Malaysia ; M. Othman ; R. Johari

The crosstalk problem is introduced by an optical multistage interconnection network, which is caused by coupling two signals within a switching element. To avoid this crosstalk, a time domain approach is used, which is to partition the set of the connections into several subsets such that the connections in each subset can be established simultaneously in the network without crosstalk. Since we want to partition the messages to be sent to the network into several groups, we have to use a window method that is used for finding the conflicts among all the messages to be sent. In this paper, we proposed two parallel window method algorithms called unbalanced parallel window method (UPWM) and balanced parallel window method (BPWM) algorithms. The UPMW algorithm reduced the execution time approximately 79%, whereas the BPMW algorithm reduced 85% of the time compared to the sequential algorithm if we use seven processors.

Published in:

2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic  (Volume:1 )

Date of Conference:

16-18 Nov. 2005