Nonblocking networks for fast packet switching
- 1 January 1989
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 548-557 vol.2
- https://doi.org/10.1109/infcom.1989.101499
Abstract
An extension of the classical theory of nonblocking networks is identified and studied that is applicable to multirate circuit and fast packet/ATM switching systems. Conditions are determined under which the Clos, Cantor, and Benes networks are strictly nonblocking. Conditions are also determined under which the Benes network and variants of the Cantor and Clos networks are rearrangeable. It is found that strictly nonblocking operation can be obtained for multirate traffic with essentially the same complexity as in the classical context.Keywords
This publication has 11 references indexed in Scilit:
- Design of a broadcast packet switching networkIEEE Transactions on Communications, 1988
- Non-blocking networksPublished by Association for Computing Machinery (ACM) ,1986
- 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
- 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
- Memory Requirements in a Telephone ExchangeBell System Technical Journal, 1950