A NONBACKTRACKING MATRIX DECOMPOSITION ALGORITHM FOR ROUTING ON CLOS NETWORKS

Authors
CARPINELLI JD ORUC AY
Citation
Jd. Carpinelli et Ay. Oruc, A NONBACKTRACKING MATRIX DECOMPOSITION ALGORITHM FOR ROUTING ON CLOS NETWORKS, IEEE transactions on communications, 41(8), 1993, pp. 1245-1251
Citations number
18
Categorie Soggetti
Telecommunications,"Engineering, Eletrical & Electronic
Journal title
IEEE transactions on communications → ACNP
ISSN journal
00906778
Volume
41
Issue
8
Year of publication
1993
Pages
1245 - 1251
Database
ISI
SICI code
0090-6778(1993)41:8<1245:ANMDAF>2.0.ZU;2-L
Abstract
A number of matrix decomposition schemes were reported for routing on Clos switching networks. These schemes occasionally fail to find the r ight 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 decomposition s. It then presents a parallel algorithm which can recognize when a pa rtition exists and set up the Clos network without backtracking.