Credit-based fair queuing
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.
See also
References
- Bensaou, Brahim; Chan, K. T.; Tsang, Danny H. K. (25–28 May 1997), "Credit-based fair queueing (CBFQ) : a simple and feasible scheduling algorithm for packet networks", IEEE ATM '97 Workshop Proceedings, Lisboa, Portugal: 589–94, doi:10.1109/ATM.1997.624744, ISBN 0-7803-4196-1
|chapter=ignored (help)
This article is issued from Wikipedia - version of the 6/10/2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.