A nonbacktracking matrix decomposition algorithm for routing on Clos networks
Authors:
- J.D. CarpineliJCJ.D. Carpineli
- A.Y. OrucAOA.Y. Oruc
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 41 (8) , 1245-1251
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Comment: Novel algorithm for Clos-type networksElectronics Letters, 1991
- Novel algorithm networks for Clos-type networksElectronics Letters, 1990
- Designing cellular permutation networks through coset decompositions of symmetric groupsJournal of Parallel and Distributed Computing, 1987
- Control Algorithms for Rearrangeable Clos NetworksIEEE Transactions on Communications, 1983
- Comments on "Decomposition of Permutation Networks"IEEE Transactions on Computers, 1982
- The Looping Algorithm Extended to Base 2tRearrangeable Switching NetworksIEEE Transactions on Communications, 1977
- On a Class of Rearrangeable Switching Networks Part I: Control AlgorithmBell System Technical Journal, 1971
- A Permutation NetworkJournal of the ACM, 1968
- A Study of Non-Blocking Switching NetworksBell System Technical Journal, 1953
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935