NXG05-1: Interleaved Multistage Switching Fabrics for Scalable High Performance Routers

As the Internet grows exponentially, scalable high performance routers and switches on backbone are required to provide a large number of ports, higher throughput, lower delay latency and good reliability. At present, most of these routers and switches are implemented on single crossbar as the switched backplane fabric. But the complexity of the single crossbar is increased with O(N2 ) in terms of crosspoint number, which is unacceptable for scalability when N becomes large. A delta class self-routing multistage interconnection network with the complexity of O(Ntimeslog2N) has been widely used in the ATM switches. However, the reduction of the crosspoint number results in the serious internal blocking. To solve this problem, quite a few scalable methods have been proposed. One of them, more stages with recirculation architecture is used to reroute the deflected packets, which increase the latency a lot. In this paper, we first bring out the multiple-panel MIN switching fabrics with interleaved recirculation. We also show how to correctly choose the recirculation points to reroute the cells, compared with the wrong connections of former publication. From the simulation under different traffic patterns, this new interleaved architecture, which is insensitive to congestion, could achieve better performance than its counterpart of single panel fabric.

[1]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[2]  Thomas E. Anderson,et al.  High speed switch scheduling for local area networks , 1992, ASPLOS V.

[3]  G. Jack Lipovski,et al.  Banyan networks for partitioning multiprocessor systems , 1998, ISCA '98.

[4]  Janak H. Patel Performance of Processor-Memory Interconnections for Multiprocessors , 1981, IEEE Transactions on Computers.

[5]  Achille Pattavina,et al.  Multistage shuffle networks with shortest path and deflection routing for high performance ATM switching: the open-loop shuffleout , 1994, IEEE Trans. Commun..

[6]  Achille Pattavina,et al.  Multistage shuffle networks with shortest path and deflection routing for high-performance ATM switching: the closed-loop shuffleout , 1994, IEEE Trans. Commun..

[7]  Tse-Yun Feng,et al.  The Universality of the Shuffle-Exchange Network , 1981, IEEE Transactions on Computers.

[8]  Nick McKeown,et al.  The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.

[9]  Nian-Feng Tzeng,et al.  Multistage-based switching fabrics for scalable routers , 2004, IEEE Transactions on Parallel and Distributed Systems.

[10]  Laxmi N. Bhuyan,et al.  Fair Scheduling in Internet Routers , 2002, IEEE Trans. Computers.

[11]  Tse-Yun Feng,et al.  On a Class of Multistage Interconnection Networks , 1980, IEEE Transactions on Computers.

[12]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[13]  Marc Snir,et al.  The Performance of Multistage Interconnection Networks for Multiprocessors , 1983, IEEE Transactions on Computers.

[14]  Nick McKeown Fast Switched Backplane for a Gigabit Switched Router , 1997 .