DocumentCode
934701
Title
A nonbacktracking matrix decomposition algorithm for routing on Clos networks
Author
Carpineli, J.D. ; Oruç, A. Yavuz
Author_Institution
Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA
Volume
41
Issue
8
fYear
1993
fDate
8/1/1993 12:00:00 AM
Firstpage
1245
Lastpage
1251
Abstract
A number of matrix decomposition schemes have been previously reported for routing on Clos switching networks. These schemes occasionally fail to find the right decomposition, unless backtracking is used. It is shown that a partition may occur during the decomposition process, and that this is the underlying reason these algorithms fail for some decompositions. A parallel algorithm which can recognize when a partition exists and set up the Clos network without backtracking is given
Keywords
matrix algebra; parallel algorithms; switching networks; telecommunication network routing; Clos networks; nonbacktracking matrix decomposition algorithm; parallel algorithm; partitioning algorithm; routing; switching networks; Algorithm design and analysis; Communication switching; Communications Society; Computer aided analysis; Matrix decomposition; Parallel algorithms; Partitioning algorithms; Routing; Switches; Telephony;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/26.231969
Filename
231969
Link To Document