A Fair Service and Dynamic Round Robin scheduling scheme for CICQ switches

The limitations in complexities and extensibilities of CICQ switchespsila scheduling policies are first analyzed. Then, based on this analysis, the guidelines for designing high extensible scheduling policies and the concept of virtual channel are proposed. Based on the guidelines and virtual channel, it comes up with a dynamic round robin scheduling algorithm-FDR (fair service and dynamic round robin), which is simple, high efficiency and fair service. FDR is based on round robin mechanism and its complexity is O(1). It allots the scheduling share for each virtual channel according to its current states. Thus, FDR has good dynamic and real-time performance, and it can adapt to unbalanced traffic load network environment. Simulation results under SPES show that FDR performs good delay, throughput and anti-burst performance, which can be applied in high performance routing and switching devices.