A new routing algorithm for multirate rearrangeable Clos networks.
type: Item
instance of: scholarly article
title: A new routing algorithm for multirate rearrangeable Clos networks.
zbMATH Open document ID: 1044.68162
DOI: 10.1016/S0304-3975(02)00579-0
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1965261
zbMATH Keywords: Clos networks
zbMATH Keywords: Routing algorithms
zbMATH Keywords: Multirate networks
zbMATH Keywords: Rearrangeable networks
author: Hung Q. Ngo
MaRDI profile type: Publication
cites work: Q5513488
cites work: Applications of matching and edge‐coloring algorithms to routing in clos networks
cites work: On Nonblocking Multirate Interconnection Networks
cites work: On Multirate Rearrangeable Clos Networks
cites work: On 1-rate wide-sense nonblocking for 3-stage Clos networks
cites work: Wide-sense nonblocking for multirate 3-stage Clos networks
cites work: Monotone routing in multirate rearrangeable Clos networks
cites work: Rearrangeability of multi‐connection three‐stage clos networks
cites work: Q4515745
cites work: On Rearrangeability of Multirate Clos Networks
cites work: Q4515737
cites work: Nonblocking Multirate Networks
cites work: Lower bounds for wide-sense nonblocking Clos network
full work available at URL: s0304-3975(02)00579-0
OpenAlex ID: W2009828849
description: scientific article; zbMATH DE number 1965261