FSS: A novel frame-based stable scheduling scheme as the complexity primitive
Fang Dong, Xiaomin Ran, Yingchun Chen, Yuxiang Hu · 2011
As Internet traffic grows explosively, high-speed switches and routers with large capability are becoming necessary, scalable multi-stage switching fabric is the next step. Nevertheless, current scheduling schemes based on random matching or round-robin dispatching for Memory-Space-Memory (MSM) Clos switching fabric, are subjected to the limited throughput and time delay under non-uniform traffic. As the complexity primitive, this paper introduces the Frame-based Stability-guaranteed Scheduling scheme (FSS) by relaxing the time constraint of scheduling. The stability of FFS as the primary academic analysis is proved too. At last, our simulation results show that FSS can achieve higher throughput under non-uniform traffic compared to current schemes, while keeping high performance under uniform traffic with low implementation complexity.