Traffic analysis of rectangular SW-banyan networks

An algorithm to route packets in rectangular SW-banyans is described. A packet-switching scheme is modeled on single-sided and double-sided SW-banyans. Effects of queue lengths and processor configurations on performance are studied. Prevention of deadlocks in the network is discussed. Simulation results suggest a scheme with varying queue lengths for different levels of the network to optimize performance, and that the length be limited. The algorithm presented is able to take advantage of the network traffic information stored at a node and dynamically route a packet through a shortest path which has the least load.<
>