A new decomposition algorithm for rearrangeable Clos interconnection networks
Authors:
- Hyun Yeop LeeHLHyun Yeop Lee
- F.K. HwangFHF.K. Hwang
- J.D. CarpinelliJCJ.D. Carpinelli
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 44 (11) , 1572-1578
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A nonbacktracking matrix decomposition algorithm for routing on Clos networksIEEE Transactions on Communications, 1993
- Comment: Novel algorithm for Clos-type networksElectronics Letters, 1991
- Novel algorithm networks for Clos-type networksElectronics Letters, 1990
- Comments on "A Simple Algorithm for the Control of Rearrangeable Switching Networks"IEEE Transactions on Communications, 1986
- A Simple Algorithm for the Control of Rearrangeable Switching NetworksIEEE Transactions on Communications, 1985
- Control Algorithms for Rearrangeable Clos NetworksIEEE Transactions on Communications, 1983
- Decomposition of Permutation NetworksIEEE Transactions on Computers, 1973
- Structure et commande optimales de réseaux de connexion sans blocageAnnals of Telecommunications, 1969
- A Study of Non-Blocking Switching NetworksBell System Technical Journal, 1953