Traffic management mechanism for fast arbitrations with QoS parameters

Arbitration between various contenders using given priority parameters is difficult to implement in hardware. We present a solution that solves this problem with minimal hardware. The solution presented is simple, fair, starvation-free, and fast. A contention resolving technique, called binary tree arbitration, is taken as a basis for implementing a "weighted fair" contention resolution technique that picks among "n" contenders, which could translate to flows, packets/cells, or connections. The extensions are priority and embedded binary tree arbitrations. Theoretical formulations of these techniques are presented. The results of their comparisons to software and hardware simulations, to show their relative conformance, are also presented.

[1]  Si-Qing Zheng,et al.  A simple and fast parallel round-robin arbiter for high-speed switch control and scheduling , 2002, The 2002 45th Midwest Symposium on Circuits and Systems, 2002. MWSCAS-2002..

[2]  Ren-Hung Hwang,et al.  QoS routing algorithms for multiple traffic classes , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[3]  Timuçin Özugur,et al.  QoS mechanism for prioritized flow-control for network elements handling high-speed traffic , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[4]  Xiaolei Guo,et al.  A fast arbitration scheme for terabit packet switches , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[5]  V. Fineberg,et al.  A practical architecture for implementing end-to-end QoS in an IP network , 2002, IEEE Commun. Mag..

[6]  Jin Xiao.  Two simple implementation algorithms of WFQ and their performance analysis , 2002 .

[7]  P. Homan,et al.  Enabling quality of service in input-queued packet switches , 2001, EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439).

[8]  Chen-Khong Tham,et al.  A probabilistic priority scheduling discipline for multi-service networks , 2001, Proceedings. Sixth IEEE Symposium on Computers and Communications.

[9]  H. Jonathan Chao,et al.  A terabit IP switch router using optoelectronic technology , 1999, J. High Speed Networks.