Distro: a distributed static round-robin scheduling algorithm for bufferless Clos-Network switches

The Clos-network is widely recognized as a scalable architecture for high-performance switches and routers. Since more contention points are introduced in the multistage network, cell buffers are commonly used to resolve the contention. Recently, several scheduling algorithms have been proposed for the buffered Clos-Network switches. These approaches will cause either mis-sequence or memory speedup problem. In this paper, we propose a highly scalable bufferless Clos-network switching architecture. We also propose a distributed scheduling algorithm, Distro. It is based on a novel scheduling technique termed Static Round-Robin (SRR). Our simulation results demonstrate that our algorithm achieves 100% throughput under uniform traffic.

[1]  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.

[2]  Jonathan S. Turner,et al.  Design of a gigabit ATM switch , 1997, Proceedings of INFOCOM '97.

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

[4]  Andrea Francini,et al.  A distributed scheduling architecture for scalable packet switches , 2000, IEEE Journal on Selected Areas in Communications.

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

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

[7]  Thomas E. Anderson,et al.  High-speed switch scheduling for local-area networks , 1993, TOCS.

[8]  H. Jonathan Chao,et al.  On the performance of a dual round-robin switch , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[9]  Paolo Giaccone,et al.  Towards simple, high-performance schedulers for high-aggregate bandwidth switches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

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