Upper bounds on fanout in connection networks

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.