Packet Dispatching Algorithms with the Static Connection Patterns Scheme for Three-Stage Buffered Clos-Network Switches

Rapid expansion of the Internet and increasing demand for multimedia services fosters an immediate need for the development of new high-capacity networks capable of supporting these growing bandwidth requirements. The development of broadband transport networks resulted in the need for next generation switches/routers with high-speed interfaces and large switching capacity. The main part of every switching node is a switching fabric, which provides a connecting path between input and output lines. For high-performance switches and routers the Clos-network is very attractive because of its modular architecture and scalability. In packet switching systems packet dispatching algorithms were adopted to avoid packet contention, which may occur while a packet is being routed in a switching fabric. Different dispatching schemes for the buffered Clos-network switches were proposed in many papers. Most of them consist of request, grant and accept phases, and cannot work in the real environment. In this paper the application of static connection patterns to packet dispatching algorithms for the three-stage buffered Clos-network switches is proposed. The performance of two such algorithms, called static desynchronization (SD) and maximal matching static desynchronization (MMSD), is evaluated and compared with results obtained for CRRD (concurrent round-robin dispatching) and CMSD (concurrent master-slave round-robin dispatching) schemes. We would like to show that it is possible to use a very simple packet dispatching scheme and obtain an acceptable performance for a wide range of traffic load per input port.

[1]  Mounir Hamdi,et al.  Dispatching schemes for Clos-network switches , 2004, Comput. Networks.

[2]  Joseph Y. Hui,et al.  A Broadband Packet Switch for Integrated Transport , 1987, IEEE J. Sel. Areas Commun..

[3]  Eiji Oki,et al.  Broadband Packet Switching Technologies: A Practical Guide to ATM Switches and IP Routers , 2001 .

[4]  Ying Jiang,et al.  A fully desynchronized round-robin matching scheduler for a VOQ packet switch architecture , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[5]  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).

[6]  Ken Christensen,et al.  An evolution to crossbar switches with virtual output queuing and buffered cross points , 2003 .

[7]  J. Chao.  Saturn: a terabit packet switch using dual round robin , 2000 .

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

[9]  Eiji Oki,et al.  Broadband Packet Switching Technologies , 2001 .

[10]  J. Kleban,et al.  CRRD-OG: a packet dispatching algorithm with open grants for three-stage buffered clos-network switches , 2006, 2006 Workshop on High Performance Switching and Routing.

[11]  Y. Tamir,et al.  High-performance multi-queue buffers for VLSI communications switches , 1988, ISCA '88.

[12]  Yuval Tamir,et al.  High-performance multiqueue buffers for VLSI communication switches , 1988, [1988] The 15th Annual International Symposium on Computer Architecture. Conference Proceedings.

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

[14]  Eiji Oki,et al.  A pipeline-based approach for maximal-sized matching scheduling in input-buffered switches , 2001, IEEE Communications Letters.

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

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