The rerouting banyan network

Abstract

This paper proposes a high-through put selfrouting switch for ATM switching systems. The throughput of this switch is not decreased by internal contention. This is accomplished by using a rerouting algorithm which makes use of many embedded banyan networks and special routing information called remaining judgement times. This switch also has by-pass links for output lines and uses output buffers, which enhance switch performance by handling external contention among by-pass links and through the use of rerouting algorithms. A short-cut algorithm that improves throughput by employing the concept of the remaining judgement times is also presented. Analysis of switch throughput shows that it increases with the number of extra stages and can attain very high throughput levels.