摘要： 针对随机早期检测(RED)算法稳定性差的问题，根据排队论知识，在分析了决定其性能要素的分布规律之后，得出结论：路由器缓冲区的队列长度是非线性分布的，路由器尾丢弃率随队列平均长度的增大而增大，但不是呈线性关系。给出了一种非线性改进算法，改善了算法的稳定性。

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

Abstract: 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 non- linear, 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.

Key words: network congestion control, Random Early Detection(RED) algorithm, drop probability

中图分类号: 

• TP393