DESIGN AND PERFORMANCE ANALYSIS OF AN ASYNCHRONOUS BANYAN NETWORK SWITCH WITH WINDOW POLICY

The authors propose an architecture of an asynchronous banyan network switch with window policy. The switch operates asynchronously, and it can transmit packets of any length at any bit time. When a packet has a collision inside the switch and is blocked, the failure signal is transferred to the input controller which originated the packet. Hence there is no loss of packets in the switch. The switch has a significant advantage in that a window scheme can be implemented. The asynchronous switch with a window scheme yields significant improvement of the maximum throughput as compared with the synchronous banyan network with no window scheme. The authors analyse the maximum throughput of the asynchronous switch with finite window size. In the analysis they make some approximations. The analytical results have been verified by simulation.