Hardware implementation of packet-fair queuing schedulers in high speed networks

Recently much research attention has been focused on implementing efficient per-flow scheduling mechanism in next generation ATM switches and routers to support the high speed multiplexing of a large number of flows with diverse traffic parameters and QoS requirements over the same network link. In this paper, we present an efficient FPGA design of packet-fair queuing schedulers based on discrete backlogged rates and packet lengths. According to the results of timing simulation, this design can process IP packets at 1.2 Gb/s which is fully capable of supporting two OC-12 POS media interfaces in high speed routers.

[1]  Li Jinsheng,et al.  Design of packet-fair queuing schedulers in router , 2000, WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420).

[2]  Hui Zhang,et al.  Implementing scheduling algorithms in high-speed networks , 1999, IEEE J. Sel. Areas Commun..

[3]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM 1996.