计算机工程 ›› 2011, Vol. 37 ›› Issue (10): 79-80.doi: 10.3969/j.issn.1000-3428.2011.10.026

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

一种改进的主动队列管理算法

王新生,袁小波   

  1. (燕山大学信息科学与工程学院,河北 秦皇岛 066004)
  • 出版日期:2011-05-20 发布日期:2011-05-20
  • 作者简介:王新生(1949-),男,教授,主研方向:网络安全,网络拥塞控制;袁小波,硕士研究生

Improved Active Queue Management Algorithm

WANG Xin-sheng, YUAN Xiao-bo   

  1. (School of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China)
  • Online:2011-05-20 Published:2011-05-20

摘要:

从是否维护数据流状态信息的角度出发,提出一种改进的主动队列管理算法——SF-AQM。SF-AQM算法只维护发送速率大的数据流状态信息以降低路由器的开销,通过比较不同数据流的包到达时间间隔衡量流到达速率,识别出非适应性数据流,提高算法公平性,并使队列长度控制在目标值附近,保证算法稳定性。仿真结果表明,SF-AQM算法具有较好的公平性和稳定性,且对抑制网络拥塞有明显效果。

关键词: 拥塞控制, 主动队列管理算法, 公平性, 队列长度, 带宽利用率

Abstract:

From the angle whether maintaining flow state information, this paper presents an improved Active Queue Management(AQM)——Single Flow-AQM(SF-AQM). SF-AQM only maintenances data flow state information which has high transmission rate in order to reduce the router overhead identifies the non-adaptive flow by comparing packet the arrival intervals of different flow, improves the fairness of the algorithm, and controls the queue length under the target value to ensure the stability of the algorithm. Simulation results show SF-AQM algorithm has good performance in fairness and stability, and it is an effective algorithm in high performance communication networks congestion control.

Key words: congestion control, Active Queue Management(AQM) algorithm, fairness, queue length, bandwidth utilization rate

中图分类号: