Abstract: According to the fairness problem in Active Queue Management(AQM) algorithm, this paper proposes a novel fair AQM algorithm namely RFED. By imposing effective punishment upon non-responsive flow, it ensures the fairness of different flow. And it maintains queue arrival rate at or below queue service rate through more reasonable dropping probability according to the arrival rate. Simulation results show that the algorithm outperforms RED, CSFQ and CHOKe in stabilizing instantaneous queue length and fairness.

Key words: Active Queue Management(AQM), congestion control, fair queue

摘要： 针对主动队列管理算法普遍存在的公平性问题，提出基于速率的公平队列管理算法RFED。该算法根据分组的到达速率调节丢包率，将队列的到达速率控制在链路的服务速率下，根据非响应流UDP数据包空间分布特点，对非响应流实施有效的惩罚，以保证不同数据流之间的公平。NS仿真实验表明，该算法在公平性、稳定性等方面效果良好，无需进行复杂的参数配置，容易在现有网络中实施。

关键词: 主动队列管理, 拥塞控制, 公平队列

CLC Number: 

• TP301.6