A new routing algorithm for multirate rearrangeable Clos networks.
From MaRDI portal
Publication:1401226
DOI10.1016/S0304-3975(02)00579-0zbMath1044.68162OpenAlexW2009828849MaRDI QIDQ1401226
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00579-0
Related Items (2)
On rearrangeable multirate three-stage Clos networks ⋮ Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
Cites Work
- On 1-rate wide-sense nonblocking for 3-stage Clos networks
- Wide-sense nonblocking for multirate 3-stage Clos networks
- On Nonblocking Multirate Interconnection Networks
- Nonblocking Multirate Networks
- On Multirate Rearrangeable Clos Networks
- On Rearrangeability of Multirate Clos Networks
- Applications of matching and edge‐coloring algorithms to routing in clos networks
- Rearrangeability of multi‐connection three‐stage clos networks
- Lower bounds for wide-sense nonblocking Clos network
- Monotone routing in multirate rearrangeable Clos networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A new routing algorithm for multirate rearrangeable Clos networks.
