期刊文献+

WFQ流量调度算法研究 被引量:14

WFQ traffic scheduling algorithm
在线阅读 下载PDF
导出
摘要 高速包交换电路常常需要为各种不同要求的服务公平地分配带宽,在公平分配带宽的同时还需要满足这些服务的服务质量(QoS)参数。不同QoS需求的业务将被复用到同一条输出链路上,要为它们公平地分配带宽就需要用到各种各样的流量调度算法。加权公平队列(WFQ)是一种常用的流量调度算法。它不仅能保证带宽分配的公平性,而且具有较好的时延性能。文章较为详细地讨论了WFQ算法的基本原理。 It is often necessary to fairly allocate bandwidth among services with different requirements in high-speed packet switching circuits while meeting their QoS parameters. When queues of such services are multiplexed to a single output link, a variety of traffic scheduling algorithms are used for this purpose. Weighted Fair Queuing (WFQ) is a commonly used scheduling algorithm, which can not only ensure fairness, but also provide good delay performance. This paper discusses the basic principle of WFQ in detail.
作者 钟山 岳祥
出处 《光通信研究》 北大核心 2006年第5期16-18,共3页 Study on Optical Communications
  • 相关文献

参考文献4

  • 1Parekh Abhay K, Gallager Robert G. A generalized processor sharing approach to flow control in integrated services networks : The single-node case [ J ]. IEEE/ACM transactions on networking, 1993,1 (3) : 344-357.
  • 2Ramabhadran Sriram, Pasquale Joseph. Stratified round robin: A low complexity packet scheduler with bandwidth fairness and bounded delay [ A ]. Proceedings of ACM SIGCOMM'03 [C]. Karlsruhe, Germany: SIGCOMM'03, 2003.
  • 3Greenberg A C, Madras N. How fair is fair queuing?[J]. The Journal of ACM, 1992, (3) : 568-598.
  • 4Bennet J, Zhang H. WF2Q: Worst case fair weighted fair queuing [ A]. Proceedings of IEEE INFOCOM' 96 [ C].San Francisco, CA, USA: IEEE INFOCOM'96, 1996.

同被引文献103

引证文献14

二级引证文献41

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部