A Nonbacktracking Matrix Decomposition Algorithm for Routing on Clos Networks

Document Type

Article

Publication Date

1-1-1993

Abstract

A number of matrix decomposition schemes were reported for routing on Clos switching networks. These schemes occasionally fail to find the right decomposition, unless backtracking is used. This paper shows that a partition may occur during the decomposition process, and that this is the underlying reason these algorithms fail for some decompositions. It then presents a parallel algorithm which can recognize when a partition exists and set up the Clos network without backtracking. © 1993 IEEE

Identifier

0027640744 (Scopus)

Publication Title

IEEE Transactions on Communications

External Full Text Location

https://doi.org/10.1109/26.231969

ISSN

00906778

First Page

1245

Last Page

1251

Issue

8

Volume

41

This document is currently not available here.

Share

COinS