A Scalable Packet Sorting Circuit for High-Speed WFQ Packet Scheduling

A novel implementation of a tag sorting circuit for a weighted fair queuing (WFQ) enabled IP packet scheduler is presented. The design consists of a search tree, matching circuitry and a custom memory layout. The implementation uses 130 nm silicon technology and supports quality of service on networks at line speeds of 40 Gbps.

[1]  Anujan Varma,et al.  Efficient fair queueing algorithms for packet-switched networks , 1998, TNET.

[2]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[3]  Brahim Bensaou,et al.  Credit-based fair queueing (CBFQ): a simple service-scheduling algorithm for packet-switched networks , 2001, TNET.

[4]  Sakir Sezer,et al.  A weighted fair queuing finishing tag computation architecture and implementation , 2004, IEEE International SOC Conference, 2004. Proceedings..

[5]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[6]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[7]  Sakir Sezer,et al.  Design and implementation of a shared buffer architecture for a gigabit Ethernet packet switch , 2005, Proceedings 2005 IEEE International SOC Conference.

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

[9]  Andrea Francini,et al.  A weighted fair queueing scheduler with decoupled bandwidth and delay guarantees for the support of voice traffic , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[10]  George Varghese,et al.  Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.

[11]  George Varghese,et al.  Leap forward virtual clock: a new fair queuing scheme with guaranteed delays and throughput fairness , 1997, PODC '97.

[12]  Sakir Sezer,et al.  Design and Analysis of Matching Circuit Architectures for a Closest Match Lookup , 2006, Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW'06).

[13]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[14]  J. Pasquale,et al.  The Stratified Round Robin Scheduler: Design, Analysis and Implementation , 2006, IEEE/ACM Transactions on Networking.

[15]  Peter van Emde Boas,et al.  Design and implementation of an efficient priority queue , 1976, Mathematical systems theory.