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

This paper proposes a simple rate-based scheduling algorithm for packet-switched networks. Using a set of counters to keep track of the credits accumulated by each traffic flow, the bandwidth share allocated to each flow, and the size of the head-of-line (HOL) packets of the different flows, the alg...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking Vol. 9; no. 5; pp. 591 - 604
Main Authors: Bensaou, B., Tsang, D.H.K., King Tung Chan
Format: Journal Article
Language:English
Published: New York IEEE 01.10.2001
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Asynchronous transfer mode
Bandwidth
Communication system traffic control
Complexity
Delay
Delay effects
Jitter
Networks
Packet switched networks
Packet switching
Protection
Quality of service
Queues
Scheduling
Scheduling algorithm
Telecommunication traffic
Traffic control
ISSN:1063-6692, 1558-2566
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper proposes a simple rate-based scheduling algorithm for packet-switched networks. Using a set of counters to keep track of the credits accumulated by each traffic flow, the bandwidth share allocated to each flow, and the size of the head-of-line (HOL) packets of the different flows, the algorithm decides which flow to serve next. Our proposed algorithm requires on average a smaller complexity than the most interesting alternative ones while guaranteeing comparable fairness, delay, and delay jitter bounds. To further reduce the complexity, a simplified version (CBFQ-F) of the general algorithm is also proposed for networks with fixed packet lengths, such as ATM, by relaxing the fairness bound by a negligibly small amount.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1063-6692
1558-2566
DOI:10.1109/90.958328