Distro: a distributed static round-robin scheduling algorithm for bufferless Clos-Network switches
Authors:
- Konghong PunKPKonghong Pun
- M. HamdiM. Hamdi
- 22 December 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 2298-2302
Abstract
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.Keywords
This publication has 8 references indexed in Scilit:
- Concurrent round-robin dispatching scheme in a clos-network switch2005
- Concurrent round-robin-based dispatching schemes for Clos-network switchesIEEE/ACM Transactions on Networking, 2002
- Design of a gigabit ATM switch2002
- A fully desynchronized round-robin matching scheduler for a VOQ packet switch architecture2002
- A distributed scheduling architecture for scalable packet switchesIEEE Journal on Selected Areas in Communications, 2000
- The iSLIP scheduling algorithm for input-queued switchesIEEE/ACM Transactions on Networking, 1999
- Low-cost scalable switching solutions for broadband networking: the ATLANTA architecture and chipsetIEEE Communications Magazine, 1997
- High-speed switch scheduling for local-area networksACM Transactions on Computer Systems, 1993