Rearrangeability of multi‐connection three‐stage clos networks

DOI10.1002/net.3230020403zbMath0253.90016OpenAlexW2156203198MaRDI QIDQ5668592

Frank K. Hwang

Publication date: 1972

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230020403

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (5)

A new routing algorithm for multirate rearrangeable Clos networks. ⋮ Hypercube sandwich approach to conferencing. ⋮ Multirate multicast switching networks ⋮ A rearrangement algorithm for switching networks composed of digital symmetrical matrices ⋮ Adaptive scheduling algorithm for media-optimized traffic management in software defined networks

This page was built for publication: Rearrangeability of multi‐connection three‐stage clos networks