一种改进的随机早期检测算法  

Improved Random Early Detection Algorithm

作　　者：李成欢[1] 周华[1] 陈冬[1] 

机构地区：[1]云南大学信息技术研究所,昆明650091

出　　处：《计算机工程》2008年第3期139-140,144,共3页Computer Engineering

摘　　要：针对随机早期检测(RED)算法稳定性差的问题,根据排队论知识,在分析了决定其性能要素的分布规律之后,得出结论:路由器缓冲区的队列长度是非线性分布的,路由器尾丢弃率随队列平均长度的增大而增大,但不是呈线性关系。给出了一种非线性改进算法,改善了算法的稳定性。Aiming at the shortcomings of Random Early Detection （RED） algorithm, such as poor stability, this paper analyzes the changing rules of factors which determine the performance of RED, according to the theory of queue. It concludes that the queue-length of buffer queue is nonlinear, and the dropping probability rises with the rise of average queue-length, but not a linear function. This article presents an improvement algorithm named URED, and several simulation results prove it has better stability.

关 键 词：网络拥塞控制 随机早期检测算法 丢包率 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]