摘要
IETF推荐使用主动队列管理,如RED(Random Early Detection),来解决网络中的拥塞控制问题。但RED中平均队列长度的计算方法,导致对拥塞到来和拥塞恢复反应较慢,进而导致在没有拥塞的时候都有较高的可能性发生不必要的分组丢弃,同时也使网络吞吐量恢复较慢。提出一种新的称为MRED的算法,MRED的主要目标是优化用来进行拥塞避免的平均队列长度的计算,进而提高对网络负载变化的响应速度,降低分组丢弃概率。理论分析和仿真结果表明MRED算法提高了响应速度、吞吐量、队列长度稳定性,降低了时延,并表现出良好的鲁棒性。
The IETF has addressed the problem of congestion control by advocating the deployment of active queue management mechanisms,such as RED,in the network.But the calculation of the average queue length in the random early detection（RED） algorithm results in a poor response time when the congestion is coming or RED recovers from congestion and causes packets to be unnecessarily dropped with a high probability even during the congestion free period,resulting in slow recovery of the throughput.Propose a new algorithm,called Modified RED（MRED）.The primary objective of MRED is to optimize the calculation of the average size of the queue used for congestion avoidance and to consequently reduce the time required by RED to load changing and reduce the total loss of packets at the queue.Analysis and simulation results have been used to show that the proposed MRED algorithm significantly improves the response time,throughput,stability of the queue length and delay of RED gateways and shows good robustness.
出处
《计算机技术与发展》
2010年第12期111-114,共4页
Computer Technology and Development
基金
国家863计划项目(2009AA01Z202)
关键词
主动队列管理
拥塞控制
负载变化
active queue management
congestion control
load changing
