Routing permutations with link-disjoint and node-disjoint paths in a class of self-routable networks
Authors:
- Yuanyuan YangYYYuanyuan Yang
- Jianchao WangJWJianchao Wang
- 25 June 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Efficient protocols for permutation routing on all-optical multistage interconnection networks2002
- Optimal all-to-all personalized exchange in a class of optical multistage networksIEEE Transactions on Parallel and Distributed Systems, 2001
- Performing permutations on interconnection networks by regularly changing switch statesIEEE Transactions on Parallel and Distributed Systems, 2000
- Permutation Capability of Optical Multistage Interconnection NetworksJournal of Parallel and Distributed Computing, 2000
- Permutation realizability and fault tolerance property of the inside-out routing algorithmIEEE Transactions on Parallel and Distributed Systems, 1999
- Wide-sense nonblocking Clos networks under packing strategyIEEE Transactions on Computers, 1999
- A new self-routing permutation networkIEEE Transactions on Computers, 1996
- The complexity of routing in Clos permutation networksIEEE Transactions on Information Theory, 1994
- Notes on Shuffle/Exchange-Type Switching NetworksIEEE Transactions on Computers, 1980
- Optimal Rearrangeable Multistage Connecting NetworksBell System Technical Journal, 1964