The theory of connecting networks and their complexity: A review
- 1 January 1977
- journal article
- review article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 65 (9) , 1263-1271
- https://doi.org/10.1109/proc.1977.10701
Abstract
Connecting networks are key subsystems of communications switching systems. This paper reviews what is known about the theoretical minimum complexity of connecting networks of several different types and presents the best known explicit constructions for them. In some cases, such as for strictly nonblocking connection networks, there is a significant difference between the best known construction and the theoretical minimum complexity. In other cases, such as for rearrangeably nonblocking connecting networks, the best construction differs from the minimum by only a constant.Keywords
This publication has 13 references indexed in Scilit:
- On Crossbar Switching NetworksIEEE Transactions on Communications, 1975
- On the Complexity of Strictly Nonblocking Concentration NetworksIEEE Transactions on Communications, 1974
- Semilattice Characterization of Nonblocking NetworksBell System Technical Journal, 1973
- On non‐blocking switching networksNetworks, 1971
- A Permutation NetworkJournal of the ACM, 1968
- On the Synthesis of Signal Switching Networks with Transient BlockingIEEE Transactions on Electronic Computers, 1967
- On Definitions of Congestion in Communication NetworksBell System Technical Journal, 1965
- A limit on crosspoint numberIRE Transactions on Information Theory, 1959
- Analysis of Switching NetworksBell System Technical Journal, 1955
- Memory Requirements in a Telephone ExchangeBell System Technical Journal, 1950