计算机应用 ›› 2011, Vol. 31 ›› Issue (11): 2905-2908.DOI: 10.3724/SP.J.1087.2011.02905

• 网络与通信 • 上一篇    下一篇

改进的CHOKe公平性主动队列管理算法

田硕,高仲合   

  1. 曲阜师范大学 计算机科学学院,山东 日照 276826
  • 收稿日期:2011-04-21 修回日期:2011-06-16 发布日期:2011-11-16 出版日期:2011-11-01
  • 通讯作者: 田硕
  • 作者简介:

    田硕(1986-),男,山东枣庄人,硕士研究生,主要研究方向:计算机网络QoS、计算机网络拥塞控制;

    高仲合(1961-),男,山东济宁人,教授,主要研究方向:计算机网络与通信、网络性能管理。

Improved active queue management algorithm for fairness of CHOKe

TIAN Shuo,GAO Zhong-he   

  1. Computer Science College, Qufu Normal University, Rizhao Shandong 276826, China
  • Received:2011-04-21 Revised:2011-06-16 Online:2011-11-16 Published:2011-11-01
  • Contact: TIAN Shuo

摘要: 针对主动队列管理算法中的CHOKe算法对非响应流的惩罚力度不够、精确度不高的问题,提出一种新的惩罚非响应流算法——LRU-CHOKe。该算法以最近最少使用(LRU)击中取代CHOKe击中,提高CHOKe击中的有效性;利用路由器队列击中,自适应丢包,并结合新的丢包策略来加强对非响应流的惩罚,从而提高网络带宽公平性。仿真结果表明,LRU-CHOKe相比CHOKe和HCHOKe算法能更加有效地惩罚非响应流,实现更为公平的带宽分配。

关键词: 主动队列管理, 公平性, 非响应流, CHOKe, 最近最少使用

Abstract: Active Queue Management plays an important role in the congestion control of network. In order to solve the problem that CHOKe algorithm cannot punish the non-responsive flows enough and the low accuracy, a new algorithm, LRU-CHOKe to penalize for non-responsive flows, was proposed in the paper. The algorithm did not only replace the CHOKe hit with LRU hit to improve the effectiveness of CHOKe hit, but also used queue hit to adaptively determine the number of packet loss. A new way of dropping packets to punish non-responsive flows was adopted. The simulation results show that LRU-CHOKe performs better than CHOKe in punishing non-responsive flows. As a result, the bandwidth allocation is realized more fairly.

Key words: Active Queue Management (AQM), fairness, non-responsive flow, CHOKe, Least Recently Used (LRU)