High performance service-time-stamp computation for WFQ IP packet scheduling

In this paper the design and implementation of a unique service-time-stamp computation circuit, called the finishing tag, for WFQ based packet scheduling is presented. The implementation is based on UMC 130nm standard cell technology, and placed and routed using Cadence SoC encounter. The design targets the development of programmable IP packet scheduling circuits for next generation network processing platforms for line-rates beyond 200Gbps

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

[2]  Donald F. Towsley,et al.  On achievable service differentiation with token bucket marking for TCP , 2000, SIGMETRICS '00.

[3]  Analysis and Simulation of a Fair Queuing Algorithm , 2008 .

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

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

[6]  John Nagle,et al.  On Packet Switches with Infinite Storage , 1985, IEEE Trans. Commun..

[7]  Kumar Jayantilal Parekn Abhay,et al.  A generalized processor sharing approach to frow control in integrated services networks , 1992 .

[8]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM 1996.

[9]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[10]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM '96.

[11]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[12]  David K. Y. Yau,et al.  Adaptive proportional delay differentiated services: characterization and performance evaluation , 2001, TNET.

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

[14]  Parameswaran Ramanathan,et al.  Proportional differentiated services: delay differentiation and packet scheduling , 1999, SIGCOMM '99.

[15]  Riccardo Bettati,et al.  Providing absolute differentiated services for real-time applications in static-priority scheduling networks , 2004, IEEE/ACM Transactions on Networking.

[16]  QueueingJon,et al.  WF 2 Q : Worst-case Fair Weighted Fair , 1996 .