动态权重RED网关

A Dynamic-Weight RED Gateway

随着网络流量的增加,拥塞控制的重要性日益突出,尤其是链路拥塞控制。 IETF推荐RED(Random Early Detection)作为下一代Internet路由器的拥塞控制算法。该文在分析了RED的优点和缺点后,在现在RED算法的基础上通过改进RED算法的平均队列长度计算,使用平均队列长度的均值,判断拥塞的发生和结束,动态调整权重,提高RED对拥塞发生和拥塞结束的反应速度,缩短拥塞时间,维持较低的实际队列长度.最后用仿真验证了该方法。

The congestion control mechanisms used in Internet have been the focus of numerous studies and have undergone a number of enhancements. However, even with these enhancements, TCP connections still experience alarmingly high loss rates, especially during times of congestion. The IETF has addressed this problem by advocating the deployment of active queue management mechanisms, such as RED, in the network. But RED have some problems, for example the average queue length changing slowly when congestion starting and ending. To alleviate this problem, a Dynamic-Weight RED(DWRED) is proposed which can quickly be conscious of the congestion and dynamic adjust the weight. DWRED use the average queue length to estimate the change of the queue and adjust the weight to alleviate the congestion and drop when the congestion is over. The time of congestion is shorter than the RED. The result is proved by the simulation.