By Topic

Credit-based fair scheduling for input-queued switches

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
$31 $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)
Gourgy, A. ; Dept. of Electr. & Comput. Eng., McMaster Univ., Hamilton, Ont., Canada ; Honglin Wu ; Szymanski, T.H.

We present a novel scheduling algorithm for Internet routers with input-queued switches based on credit-based fair queueing. We present a flow-based iterative credit-based fair scheduler (iCBFS) for crossbar switches, that provides fair bandwidth distribution among flows at a fine granularity and achieves asymptotically 100% throughput, under uniform traffic. To reduce the implementation complexity of iCBFS, we present a port-based version of iCBFS that is tailored towards high-speed hardware implementation.

Published in:

Communications, 2004 IEEE International Conference on  (Volume:4 )

Date of Conference:

20-24 June 2004