RRGS-round-robin greedy scheduling for electronic/optical terabit switches
Aleksandra Smiljanić, R. Fan, G. Ramamurthy · 2003
In this paper, we propose a novel protocol for scheduling of packets in high-speed switches. The switch is assumed to use a logical cross-bar fabric with input queueing. The scheduler may be used in optical as well as electronic switches with terabit capacity. The proposed round-robin greedy scheduling (RRGS) finds a maximal matching between inputs and outputs at terabit throughput, using a pipeline technique. The pipeline approach avoids the need for internal speedup of the switching fabric to achieve high utilization. The RRGS achieves the good performance of random greedy scheduling (RGS), with small scheduling delays even at very high traffic load.