期刊文献+

近似公平带宽分配的无状态队列管理 被引量:1

A CORE-STATELESS QUEUE MANAGEMENT SCHEME OF APPROXIMATING FAIR BANDWIDTH ALLOCATION
下载PDF
导出
摘要 本文提出了一种基于速率和RED的公平排队算法RRFQ,算法能够达到近似公平的带宽分配,较好地区分短暂拥塞和持续拥塞,改善总体吞吐量,对参数设置的敏感度低。 In this paper,we propose a Rate-and-RED based Fair Queueing (RRFQ)algorithm.The algorithm is able to approximate fair bandwidth allocation,differentiate between short-term and long-term congestion,improve total throughput and is insensitive to parameter configuration.
出处 《计算机应用与软件》 CSCD 北大核心 2003年第2期45-47,共3页 Computer Applications and Software
关键词 近似公平带宽分配 无状态队列管理 路由器 公平排队 主动队列管理 突发流量 Fair queueing Active queue management Congestion Bursty traffic
  • 相关文献

参考文献4

  • 1[1]I. Stoica, S. Shenker, H. Zhang, "Core - stateless fair queueing: achieving approximately fair bandwidth allocation in high speed networks", ACMSIGCOMM'98, pp. 118 ~ 130,1998.
  • 2[2]Z. Cao, Z. Wang, E. Zegura, "Rainbow fair queueing: fair bandwidth sharing without per - flow state", INFOCOM'2000, March 2000.
  • 3[3]S. Floyd and V. Jacobson, "Random early detection for congestion avoidance", IEEE/ACM Transactions on Networking, Vol. 1, No.4, August 1993.
  • 4[4]The Network Simulator - ns - 2, Online: http://www. isi. edu/nsnam/ns/.

同被引文献5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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