By Topic

A practical fast parallel routing architecture for Clos 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)
Zheng, S.Q. ; Dept. of Comput. Sci., Univ. of Texas-Dallas, Richardson, TX ; Gumaste, A. ; Enyue Lu

Clos networks are an important class of switching networks due to their modular structure and much lower cost compared with crossbars. For routing I/O permutations of Clos networks, sequential routing algorithms are too slow, and all known parallel algorithms are not practical. We present the algorithm-hardware codesign of a unified fast parallel routing architecture called distributed pipeline routing (DPR) architecture for rearrangeable nonblocking and strictly non-blocking Clos networks. The DPR architecture uses a linear interconnection structure and processing elements that performs only shift and logic AND operations. We show that a DPR architecture can route any permutation in rearrangeable nonblocking and strictly nonblocking Clos networks in OradicN time. The same architecture can be used to carry out control of any group of connection/disconnection requests for strictly nonblocking Clos networks in OradicN time. Several speeding-up techniques are also presented. This architecture is applicable to packet and circuit switches of practical sizes.

Published in:

Architecture for Networking and Communications systems, 2006. ANCS 2006. ACM/IEEE Symposium on

Date of Conference:

3-5 Dec. 2006