Module Matching Schemes for Input-Queued Clos-Network Packet Switches

Current schemes for configuration of input-queued three-stage Clos-network (IQC) switches involve port matching and path routing assignment, in that order. The implementation of a scheduler capable of matching thousands of ports in large-size switches is complex. To decrease the scheduler complexity for such switches (e.g., 1024 ports or more), we propose a configuration scheme for IQC switches that hierarchizes the matching process. In a practical scenario our scheme performs routing first and port matching thereafter. This approach reduces the scheduler size and the configuration complexity of IQC switches. We show that the switching performance of the proposed approach using weight-based and weightless selection schemes is high under uniform and nonuniform traffic

[1]  Eiji Oki,et al.  Maximum weight matching dispatching scheme in buffered Clos-network packet switches , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[2]  H. Jonathan Chao,et al.  Matching algorithms for three-stage bufferless Clos network switches , 2003, IEEE Commun. Mag..

[3]  Nick McKeown,et al.  A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .

[4]  Roberto Rojas-Cessa,et al.  Captured-frame eligibility and round-robin matching for input-queued packet switches , 2004, IEEE Communications Letters.

[5]  Nick McKeown,et al.  Designing and implementing a fast crossbar scheduler , 1999, IEEE Micro.

[6]  Eiji Oki,et al.  Concurrent round-robin-based dispatching schemes for Clos-network switches , 2002, TNET.

[7]  Nick McKeown,et al.  Design and Implementation of a Fast Crossbar Scheduler , 1998 .

[8]  F. M. Chiussi,et al.  Low-cost scalable switching solutions for broadband networking: the ATLANTA architecture and chipset , 1997 .

[9]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[10]  Tony T. Lee,et al.  Parallel routing algorithms in Benes-Clos networks , 2002, IEEE Trans. Commun..

[11]  Mounir Hamdi,et al.  Distro: a distributed static round-robin scheduling algorithm for bufferless Clos-Network switches , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[12]  Eiji Oki,et al.  Concurrent round-robin dispatching scheme in a clos-network switch , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[13]  Mounir Hamdi,et al.  Static round-robin dispatching schemes for Clos-network switches , 2002, Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie.