Nonblocking Multirate Networks
- 1 April 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (2) , 301-313
- https://doi.org/10.1137/0218021
Abstract
An extension of the classical theory of connection networks is defined andstudied. This extension models systems in which multiple connections of differingdata rates share the links within a network. We determine conditions under whichthe Clos and Cantor networks are strictly nonblocking for multirate traffic. We alsodetermine conditions under which the Benes network and variants of the Cantor andClos networks are rearrangeable. We find that strictly nonblocking operation can beobtained...Keywords
This publication has 12 references indexed in Scilit:
- Some Graph-Colouring Theorems with Applications to Generalized Connection NetworksSIAM Journal on Algebraic Discrete Methods, 1985
- A Two-Stage Rearrangeable Broadcast Switching NetworkIEEE Transactions on Communications, 1985
- Telephone switching networksProceedings of Symposia in Applied Mathematics, 1982
- Performance of Processor-Memory Interconnections for MultiprocessorsIEEE Transactions on Computers, 1981
- Blocking States in Connecting Networks Made of Square Switches Arranged in StagesBell System Technical Journal, 1981
- Using euler partitions to edge color bipartite multigraphsInternational Journal of Parallel Programming, 1976
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- On a Class of Rearrangeable Switching Networks Part I: Control AlgorithmBell System Technical Journal, 1971
- On non‐blocking switching networksNetworks, 1971
- A Study of Non-Blocking Switching NetworksBell System Technical Journal, 1953