IETF推荐RED(Random Early Detection)作为下一代Internet路由器的拥塞控制算法.但RED中平均队列长度对实际队列变化反应较慢
导致出现拥塞的时间增加
丢包增多
本文在现有RED算法的基础上通过改进RED算法的平均队列长度计算
使用平均队列长度的均值
判断拥塞的发生和结束
动态调整权重
提高RED对拥塞发生和拥塞结束的反应速度.仿真结果表明算法减少了拥塞时间
能够维持较低的实际队列长度
进而减少了数据包排队时间.
Abstract
The IETF has addressed the congestion control by advocating the deployment of active queue management mechanisms
such as RED
in the network.But RED has some problems
such as the average queue length changes slowly when congestion starts and ends.To alleviate this problem
we propose a dynamic-weight tune RED which can quickly be conscious of the congestion and dynamically tune the weight.Dynamic-Weight RED can alleviate the congestion and drop when the congestion is over.The time of congestion is shorter than the RED.