By Topic

QoS mechanism for prioritized flow-control for network elements handling high-speed traffic

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
P. Golla ; Res. & Innovation Center, Plano, TX, USA ; G. Damm ; T. Ozugur

Handling of QoS priorities to differentiate flows is critical in the next generation Internet with ever increasing traffic. We present a scheme called p-persistent binary tree arbiter (PBTA) that approximates the general processor sharing (GPS) model. PBTA arbitrates between contending flows based on various quality of service parameters which are mapped to their weights or priorities; and, by being stateful, it provides a fair arbitration among the contending flows across the individual timeslots. Our simulations show that PBTA provides a fair technique among the flows by providing the proper service ratios and transit times conforming to the appropriate traffic classes. The advantage of the scheme is that it requires no modifications to the other scheduling algorithms. The preliminary FPGA implementation shows that the mechanism is implementable, fast, and conservative in chip area.

Published in:

Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE  (Volume:7 )

Date of Conference:

1-5 Dec. 2003