By Topic

Parallel routing algorithms for nonblocking electronic and photonic multistage switching 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

2 Author(s)
Enyue Lu ; Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA ; Zheng, S.Q.

Summary form only given. Nonblocking multistage interconnection networks are favored to be used as switching networks whenever possible. Crosstalk-free requirement in photonic networks adds a new dimension of constraints for nonblockingness. Routing algorithms play a fundamental role in nonblocking networks, and any algorithm that requires more than linear time would be considered too slow for real-time applications. One remedy is to use multiple processors to route connections in parallel. In this paper, we study the connection capacity of a class of rearrangeable nonblocking and strictly nonblocking networks with/without crosstalk-free constraint, model their routing problems as weak or strong edge colorings of bipartite graphs, and propose efficient routing algorithms for these networks using parallel processing techniques.

Published in:

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

Date of Conference:

26-30 April 2004