Global and dynamic round-robin scheduler for terabit routers

In this paper we propose a mew greatly scheduling algorithm for crossbar terabit routers with virtual output queuing (VOQ) at input ports. The proposed global and dynamic round-robin (GDRR) scheduler is pipelined scheduler. Our empirical studies show that: 1) the scheduler provides minimum service rate (MSR) guarantees for high-priority confirming traffic, 2) by using the global round-robin method available bandwidth at any output port is fairly shared among input ports (the input port fairness), and 3) by using the dynamic round-robin method available bandwidth at any input port is fairly shared among VOQs (the output port fairness). Increasing the number of scheduling modules linearly increases the latency of the scheduler, while increasing the number of supported traffic classes does not affect its design.