Credit-based fair queuing

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by imported>Citation bot at 01:30, 4 August 2023 (Removed parameters. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox2 | #UCB_webform_linked 351/1809). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description

File:Traffic-shaping.pdf
Example IEEE 802.1Qav traffic shaping

Credit-based fair queuing is a computationally efficient alternative to fair queueing. Credit is accumulated to queues as they wait for service. Credit is spent by queues while they are being serviced. Queues with positive credit are eligible for service. The rate of credit accumulation and release can be adjusted on a queue-by-queue basis to produce a weighted queuing behavior.

Credit-based queuing is used in Resilient Packet Ring networks and in the IEEE 802.1Qav component of Audio Video Bridging and its successor, Time Sensitive Networking. In IEEE 802.1Qav, it is called Credit Based Shaper (CBS).

See also

References

  • Script error: No such module "citation/CS1".
  • Bensaou, Brahim; Tsang, Danny H. K.; Chan, K.T. "Credit-based fair queueing (CBFQ): a simple service-scheduling algorithm for packet-switched networks", IEEE/ACM Transactions on Networking 9(5): 591-604 (2001), doi:10.1109/90.958328


Template:Asbox

Retrieved from "http://debianws.lexgopc.com/wiki143/index.php?title=Credit-based_fair_queuing&oldid=7057303"