By Topic

Credit-based fair queueing (CBFQ): a simple and feasible scheduling algorithm for packet networks

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)
Bensaou, B. ; Dept. of Electr. & Electron. Eng., Hong Kong Univ. of Sci. & Technol., Hong Kong ; Chan, K.T. ; Tsang, D.H.K.

A simple rate-based scheduling algorithm for packet-switched networks (e.g. Internet, ATM) is proposed. By using simple counters to keep trade of the amount of credits accumulated by each traffic stream, the algorithm decides which stream to serve next based on the bandwidth share allocated to each traffic stream and the sizes of their respective head of line (HOL) packets. Our proposed CBFQ algorithm achieves the same fairness and delay bounds as the alternative approaches based on virtual time, while avoiding the implementation problems inherent in these methods. In addition, to take advantage of the fixed packet size in ATM networks, a variant of the algorithm (CBFQ-F) is proposed. By relaxing the fairness bound by a negligible amount, CBFQ-F achieves a complexity of O(1)

Published in:

IEEE ATM Workshop 1997. Proceedings

Date of Conference:

25-28 May 1997