Upper bounds on fanout in connection networks
- 1 May 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 20 (3) , 222-229
- https://doi.org/10.1109/tct.1973.1083686
Abstract
Upper bounds, some of which are shown to be least upper bounds, are established on the number of output stations, and, hence, the number of output terminals in multistage networks realizing full fanout connection assignments. Networks meeting these conditions are shown to be either rearrangeable or nonblocking and to have less switches than the product of the input and output terminals for a sufficiently large number of such terminals.Keywords
This publication has 3 references indexed in Scilit:
- Generalized multi‐stage connection networksNetworks, 1972
- On Rearrangeable Three-Stage Connecting NetworksBell System Technical Journal, 1962
- Systems of Distinct Representations and Linear ProgrammingThe American Mathematical Monthly, 1956