IEEE Transactions on Communications · 1995 · 28 citations · 7 references
ComputingComputer EngineeringComputer ScienceComputer NetworksDiscrete MathematicsInterconnection NetworksCommunication NetworksMultistage Interconnection NetworksNetwork SwitchingNetwork TopologyPacket SwitchingRoutingBlocking PropertiesClos NetworksMulticast SwitchingMultistage Switching NetworksNonblocking NetworksNonblocking PropertiesOutletsStrictly Nonblocking Networks
The paper studies three-stage switching networks capable of routing point-to-multipoint connections. Strict-sense non-blocking operation is addressed and, in particular, the necessary and sufficient condition for a three-stage switching network to be strictly non-blocking when it is offered point-to-multipoint traffic is derived. This condition is given as a function both of the minimum and the maximum number of network outlets addressed by each connection. In this respect, the paper extends the well known Clos' result, giving the necessary and sufficient condition for a three-stage switching network to be strictly non-blocking when it is offered point-to-point traffic. The complexity of a three-stage network is lower than that of a crossbar of equal size only for small values of the maximum admissible fanout of the incoming connections.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
7
A Study of Non-Blocking Switching Networks
Charles Clos · Bell System Technical Journal · 1953 · 1.7K citations
Nonblocking broadcast switching networks
Yuanyuan Yang, Gerald M. Masson · IEEE Transactions on Computers · 1991 · 156 citations
Generalized multi‐stage connection networks
Gerald M. Masson, B. W. Jordan · Networks · 1972 · 113 citations