首页 | 本学科首页   官方微博 | 高级检索  
     

动态权重调整RED
引用本文:江昊,晏蒲柳,吴静,周建国.动态权重调整RED[J].电子学报,2005,33(3):574-577.
作者姓名:江昊  晏蒲柳  吴静  周建国
作者单位:武汉大学电子信息学院,湖北武汉 430079
摘    要:IETF推荐RED(Random Early Detection)作为下一代Internet路由器的拥塞控制算法.但RED中平均队列长度对实际队列变化反应较慢,导致出现拥塞的时间增加,丢包增多,本文在现有RED算法的基础上通过改进RED算法的平均队列长度计算,使用平均队列长度的均值,判断拥塞的发生和结束,动态调整权重,提高RED对拥塞发生和拥塞结束的反应速度.仿真结果表明算法减少了拥塞时间,能够维持较低的实际队列长度,进而减少了数据包排队时间.

关 键 词:RED  平均队列长度  拥塞控制  
文章编号:0372-2112(2005)03-0574-04
收稿时间:2003-03-03

A Dynamic-Weight Tune RED Gateway
JIANG Hao,YAN Pu-liu,WU Jing,ZHOU Jian-guo.A Dynamic-Weight Tune RED Gateway[J].Acta Electronica Sinica,2005,33(3):574-577.
Authors:JIANG Hao  YAN Pu-liu  WU Jing  ZHOU Jian-guo
Affiliation:School of Electronic Information,Wuhan University,Wuhan,Hubei 430079,China
Abstract:The IETF has addressed the congestion control by advocating the deployment of ac tive queue management mechanisms,such as RED,in the network.But RED has some pr oblems,such as the average queue length changes slowly when congestion starts and ends.To alleviate this problem,we propose a dynamic-weight tune RED whic h can quickly be conscious of the congestion and dynamically tune the weight.Dyn amic -Weight RED can alleviate the congestion and drop when the congestion is over.T he time of congestion is shorter than the RED.
Keywords:RED
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号