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.