A nonbacktracking matrix decomposition algorithm for routing on Clos networks

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 u...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on communications Vol. 41; no. 8; pp. 1245 - 1251
Main Authors:	Carpineli, J.D., Oruc, A.Y.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01-08-1993 Institute of Electrical and Electronics Engineers
Subjects:	Algorithm design and analysis Applied sciences Communication switching Communications Society Computer aided analysis Exact sciences and technology Matrix decomposition Parallel algorithms Partitioning algorithms Routing Switches Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Telephony Teletraffic Telecommunication switching Backtracking Routing Parallel algorithm Matrix decomposition Telecommunication network
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.< >
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0090-6778 1558-0857
DOI:	10.1109/26.231969