APRED:基于Avg和P的RED改进算法  

APRED:RED Improved Algorithm Based on Avg and P

作　　者：王斌[1] 邓春红[1] 王飞[1] 阳建中[2] 

机构地区：[1]安徽机电职业技术学院信息工程系,芜湖241000 [2]钦州学院数计学院,钦州535000

出　　处：《现代计算机》2013年第10期17-20,28,共5页Modern Computer

摘　　要：RED算法是IETF推荐的AQM唯一候选算法,但RED中存在Avg对实际队列变化反应较慢,丢弃概率不准确等问题。为了更准确地计算平均队列长度和丢弃概率,对RED算法的平均队列计算方式(Avg)进行动态调整,并且对丢弃概率P进行非线性优化,进而提出一种改进算法APRED。仿真结果表明,改进后的算法在持久流和突发流情况下均能够减小平均队列的抖动,提高瓶颈链路平均吞吐量,降低路由器丢包率,提高了算法的网络适应性。RED algorithm is the only candidate algorithm which is recommended by IETF, but RED has some problems,such as the avg changes slowly when congestion starts and drop probability is not accurate. In order to more precisely calculate the avg and p, proposes an improved RED al- gorithm,called APRED, which dynamically adjusts the avg and non-linear modifies P. Simula- tion results show that the improved algorithm can get a better average throughput in the bottle- neck link and has lower packet loss rate in router. Whether in the case of persistent stream and sudden stream the APRED algorithm will be able to reduce the fluctuations of the average queue. The algorithm has a better network adaptability.

关 键 词：随机早期检测算法(RED) 拥塞控制 平均队列长度 非线性化 丢包率 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]