Performance of shuffle-like switching networks with deflection

Four packet-switched networks using shuffle-exchange interconnections and deflection routing are analyzed. The first two are well-known networks based solely on shuffle interconnections, and the other two are variations in which the negative effects of deflection are reduced. Approximate state equations are given under a uniform traffic assumption. The equations predict the distribution of packet delay and can be used in situations where packets are assigned priorities. The four networks are briefly compared to each other and to Batcher-Banyan sorting networks and hypercube deflection networks