A Nonbacktracking Matrix Decomposition Algorithm for Routing on Clos Networks

John D. Carpinelli, A. Yavuz Oruç

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)1245-1251
Number of pages7
JournalIEEE Transactions on Communications
Volume41
Issue number8
DOIs
StatePublished - Aug 1993

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A Nonbacktracking Matrix Decomposition Algorithm for Routing on Clos Networks'. Together they form a unique fingerprint.

Cite this