Premium
Generalized multi‐stage connection networks
Author(s) -
Masson G. M.,
Jordan B. W.
Publication year - 1972
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230020303
Subject(s) - connection (principal bundle) , computer science , terminal (telecommunication) , product (mathematics) , upper and lower bounds , topology (electrical circuits) , mathematics , mathematical optimization , combinatorics , computer network , mathematical analysis , geometry
This paper develops multi‐stage connection networks in which each input terminal can be connected to any number of output terminals. Conditions are given such that these networks are strictly nonblocking or are rearrangeable. Rearrangement algorithms and upper bounds on the required number of moves are developed and it is shown that such networks have fewer cross‐points than the product of input and output terminals for a sufficiently large number of input and output terminals.