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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE/ACM transactions on networking Ročník 9; číslo 5; s. 591 - 604
Hlavní autoři: Bensaou, B., Tsang, D.H.K., King Tung Chan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.10.2001
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:1063-6692, 1558-2566
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract 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.
AbstractList 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.
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
Author Bensaou, B.
Tsang, D.H.K.
King Tung Chan
Author_xml – sequence: 1
  givenname: B.
  surname: Bensaou
  fullname: Bensaou, B.
  organization: Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., Kowloon, China
– sequence: 2
  givenname: D.H.K.
  surname: Tsang
  fullname: Tsang, D.H.K.
– sequence: 3
  surname: King Tung Chan
  fullname: King Tung Chan
BookMark eNqF0TtLBDEQAOAgCj4LW6tg4aNYzWOTS-z08AUHImi9JJtZje5tziSr-O_d4w4LEa1mmPlmYJhNtNqFDhDapeSEUqJPNTnRQnGmVtAGFUIVTEi5OuRE8kJKzdbRZkovhFBOmNxAMI7gfC6sSeBwY3zEbz304LsnfDS-uLo_PsMGJz-dtYATxHdfQ5HqZ3B9OzemfQrR5-cpbkLEM1O_Qi7Sh89zgjvIHyG-pm201pg2wc4ybqHHq8uH8U0xubu-HZ9PiprLUS600eCsdXTENBW1tNwRBw0wa7mirBFSDzVmhGNMjqi0pTOEMmGs1A0By7fQ4WLvLIbhjJSrqU81tK3pIPSp0rSUJeOKDfLgT8kUY5xw9T-UUpFyRAe4_wO-hD52w7mVUqXQggg-oNMFqmNIKUJT1T6b7EOXo_FtRUk1f2OlSbV44zBx_GNiFv3UxM9f7d7CegD4dsvmF65mpl4
CODEN IEANEP
CitedBy_id crossref_primary_10_1049_el_2014_3994
crossref_primary_10_1109_TVT_2011_2119501
crossref_primary_10_1109_LCOMM_2002_804248
crossref_primary_10_1109_TVLSI_2008_2000323
crossref_primary_10_1109_TVT_2007_905246
crossref_primary_10_1109_JSAC_2003_815232
crossref_primary_10_1109_JSYST_2019_2939409
crossref_primary_10_1016_j_comcom_2005_10_021
crossref_primary_10_3390_s18103444
crossref_primary_10_1016_j_vlsi_2011_01_001
crossref_primary_10_1109_TCOMM_2015_2409172
crossref_primary_10_1145_3068281
crossref_primary_10_1002_nem_640
crossref_primary_10_1109_TWC_2015_2466539
crossref_primary_10_1109_JSYST_2019_2924338
crossref_primary_10_1109_TWC_2007_051014
crossref_primary_10_1109_MWC_2007_314549
Cites_doi 10.1145/75246.75248
10.1109/INFCOM.1996.497885
10.1109/INFCOM.1996.493359
10.1109/90.649569
10.1145/103720.103721
10.1109/26.87215
10.1109/INFCOM.1996.493357
10.1002/dac.4500070407
10.1109/90.502236
10.1049/el:19961580
10.1109/90.234856
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2001
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2001
DBID RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
F28
FR3
DOI 10.1109/90.958328
DatabaseName IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE/IET Electronic Library (IEL) (UW System Shared)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-2566
EndPage 604
ExternalDocumentID 2431596291
10_1109_90_958328
958328
GroupedDBID -DZ
-~X
.DC
0R~
29I
4.4
5GY
5VS
6IK
85S
8US
97E
9M8
AAJGR
AAKMM
AALFJ
AARMG
AASAJ
AAWTH
AAWTV
ABAZT
ABPPZ
ABQJQ
ABVLG
ACGFS
ACGOD
ACIWK
ACM
ADBCU
ADL
AEBYY
AEFXT
AEJOY
AENSD
AETEA
AETIX
AFWIH
AFWXC
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AIKLT
AKJIK
AKQYR
AKRVB
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BDXCO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CCLIF
CS3
D0L
EBS
EJD
FEDTE
GUFHI
HF~
HGAVV
HZ~
H~9
I07
ICLAB
IEDLZ
IES
IFIPE
IFJZH
IPLJI
JAVBF
LAI
LHSKQ
M43
MVM
O9-
OCL
P1C
P2P
PQQKQ
RIA
RIE
RNS
ROL
TN5
UPT
UQL
VH1
XOL
YR2
ZCA
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
F28
FR3
ID FETCH-LOGICAL-c367t-9a9edbbd172915c6b3d0defe2bb3812f5696b32a5d226716b4da0125ab69f0eb3
IEDL.DBID RIE
ISICitedReferencesCount 41
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000171708700006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1063-6692
IngestDate Sun Sep 28 02:44:01 EDT 2025
Sat Sep 27 18:48:49 EDT 2025
Sun Sep 28 10:57:03 EDT 2025
Sun Nov 30 04:17:56 EST 2025
Sat Nov 29 03:05:09 EST 2025
Tue Nov 18 22:04:26 EST 2025
Tue Aug 26 21:00:33 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 5
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c367t-9a9edbbd172915c6b3d0defe2bb3812f5696b32a5d226716b4da0125ab69f0eb3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
PQID 884595053
PQPubID 23500
PageCount 14
ParticipantIDs proquest_miscellaneous_28223038
proquest_journals_884595053
crossref_primary_10_1109_90_958328
proquest_miscellaneous_914642382
crossref_citationtrail_10_1109_90_958328
ieee_primary_958328
proquest_miscellaneous_26680471
PublicationCentury 2000
PublicationDate 2001-10-01
PublicationDateYYYYMMDD 2001-10-01
PublicationDate_xml – month: 10
  year: 2001
  text: 2001-10-01
  day: 01
PublicationDecade 2000
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE/ACM transactions on networking
PublicationTitleAbbrev TNET
PublicationYear 2001
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref12
ref14
ref11
ref10
parekh (ref2) 1992
roberts (ref15) 1993
ref1
ref17
golestani (ref5) 1994
rexford (ref7) 1996
benett (ref9) 1996
golestani (ref6) 0
ref8
chan (ref13) 1996
ref4
ref3
goyal (ref16) 1995
References_xml – year: 1996
  ident: ref13
  publication-title: Resource allocation and QoS guarantee in high speed networks
– start-page: 915
  year: 1992
  ident: ref2
  article-title: a generalized processor sharing approach to flow control in integrated services network
  publication-title: Proc IEEE InfoCom
– start-page: 287
  year: 1995
  ident: ref16
  article-title: determining end-to-end delay bounds in heterogeneous networks
  publication-title: Proc 7th Int Workshop Network and Operating System Support for Digital Audio and Video
– ident: ref3
  doi: 10.1145/75246.75248
– start-page: 120
  year: 1996
  ident: ref9
  article-title: wf$^2$q: worst case weighted fair queueing
  publication-title: Proc IEEE InfoCom
  doi: 10.1109/INFCOM.1996.497885
– start-page: 638
  year: 1996
  ident: ref7
  article-title: hardware-efficient fair queueing architectures for high-speed networks
  publication-title: Proc IEEE InfoCom
  doi: 10.1109/INFCOM.1996.493359
– ident: ref11
  doi: 10.1109/90.649569
– ident: ref17
  doi: 10.1145/103720.103721
– ident: ref1
  doi: 10.1109/26.87215
– start-page: 636
  year: 1994
  ident: ref5
  article-title: a self-clocked fair queueing scheme for broadband applications
  publication-title: Proc IEEE InfoCom
– ident: ref8
  doi: 10.1109/INFCOM.1996.493357
– ident: ref14
  doi: 10.1002/dac.4500070407
– start-page: 39
  year: 0
  ident: ref6
  article-title: fair queueing algorithms for packet scheduling in bisdn
  publication-title: LNCS 1044 Broadband Communications 1996 International Zurich Seminar on Digital Communications
– ident: ref10
  doi: 10.1109/90.502236
– year: 1993
  ident: ref15
  article-title: a traffic control framework for high speed data transmission
  publication-title: IFIP Trans C-15 Modeling and Performance Evaluation of ATM Technol
– ident: ref12
  doi: 10.1049/el:19961580
– ident: ref4
  doi: 10.1109/90.234856
SSID ssj0013026
Score 1.8910937
Snippet 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...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 591
SubjectTerms 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
Title Credit-based fair queueing (CBFQ): a simple service-scheduling algorithm for packet-switched networks
URI https://ieeexplore.ieee.org/document/958328
https://www.proquest.com/docview/884595053
https://www.proquest.com/docview/26680471
https://www.proquest.com/docview/28223038
https://www.proquest.com/docview/914642382
Volume 9
WOSCitedRecordID wos000171708700006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1558-2566
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0013026
  issn: 1063-6692
  databaseCode: RIE
  dateStart: 19930101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwELZoxQEOLRRQty1goR7Kwa3XSZxMb7BixakCiUq9RX6MYUXJVpts-_c7drLbIgoSt8ieyJZf3zee8Qxjh0TxQ9CVFlh4KXLlnICAuTAarMpD7hT2ySbKs7Pq4gK-DHG201sYREzOZ3gcP5Mt38_dMl6VnUBB66_aYBtlqfunWncGA5kyq5GCkwmtQQ1BhMYSTkAe9z_-Bj0pl8ofB3BClen2f_XnGdsayCP_0M_2c_YImx329F5IwRcMJwuCo05EdPI8Wms4NbxEquRHk4_Tr-9PueHtLAYF5m1_UAjScAlx4sN0bi6_zxez7scvTmyWk0L9EzvR3szi5Hre9E7j7Ut2Pv30bfJZDKkUhMt02QkwgN5aT3QFxoXTNvPSY0BlLUG2CoUGKlOm8ETHSIWyuTcEXYWxGoIkhfsV22zmDe4ynoVAMO8y8CbPnVHWu3GZwt77QIAbRuxoNcq1G-KMx3QXl3XSNyTUIOt-5Ebs3Vr0qg-u8ZDQThz5tcCqdH81c_Ww69q6qvICiNJlI_Z2XUvbJdpATIPzZVsTH6kkAfI_JIgyEa5TC_wvEkDoQiy0UnsPdm2fPUmOasnj74BtdoslvmaP3XU3axdv0rK9BdIf7jM
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dTxQxEJ8omCgPoAjxQKUxPuBDodft9ra-6cULBrhogglvm37CBdwzt3vw7zPt7p0a0cS3TTubNv36_aYznQF4ixQ_BFlI6nPHqODWUhW8oFoqw0UQlvs22cRgPC7Oz9WXLs52egvjvU_OZ_4gfiZbvpvaebwqO1Q5rr_iIazmQnDWPtb6aTJgKbcaqjgZlVLxLoxQn6lDxQ7aX38Dn5RN5Y8jOOHKaOO_evQU1jv6SD608_0MHvhqE9Z-CSr4HPxwhoDU0IhPjkR7DcGG5x4ryf7w4-jru_dEk3oSwwKTuj0qKOq4iDnxaTrR1xfT2aS5_E6QzxJUqa98Q-vbSZxeR6rWbbzegm-jT2fDI9olU6A2k4OGKq28M8YhYVH93EqTOeZ88NwYBG0ecqmwjOvcISFDJcoIpxG8cm2kCgxV7m1YqaaVfwEkCwGB3mbKaSGs5sbZ_iAFvncBITf0YH8xyqXtIo3HhBfXZdI4mCoVK9uR68GbpeiPNrzGfUKbceSXAovS3cXMld2-q8uiELlCUpf1YG9ZixsmWkF05afzukRGUjCE5H9IIGlCZMcWyF8kFOIL8tCC79zbtT14fHR2elKefB4f78KT5LaW_P9ewkozm_tX8MjeNJN69jot4TtUY_F6
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Credit-based+fair+queueing+%28CBFQ%29%3A+a+simple+service-scheduling+algorithm+for+packet-switched+networks&rft.jtitle=IEEE%2FACM+transactions+on+networking&rft.au=Bensaou%2C+B&rft.au=Tsang%2C+DHK&rft.au=Tung+Chan%2C+King&rft.date=2001-10-01&rft.issn=1063-6692&rft.volume=9&rft.issue=5&rft_id=info:doi/10.1109%2F90.958328&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6692&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6692&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6692&client=summon