利用可变队列长度的AQM改进与研究

AQM（主动队列管理）通过在拥塞的早期阶段丢包来告知信源。AQM改进了响应流（如TCP）和非响应流（如UDP）之间的公平性，它可以带来较高的吞吐量及有效的链路。提出了可变队列长度适应RED算法，它基于每小时的可变队列长度，并且可以更有效地应对突发流。如果将当前可变队列长度与RED及ARED相比，这种方法可以提供更为平缓的平均度列长度。试验结果表明，可变队列长度适应RED比弃尾法提高了公平性，与ARED比较性能也大为改观。这样即使有突发流存在，也可以使数据包稳定地传输。

Research and Development of AQM on the Base of VAQ

AQM（Active Queue Management） informs the source that congestion has happened in the way of dropping message. In this way it has improved the fairness between TCP and UDP, and at the same time, links become more effective. In this paper, it mainly analyses a new kind of RED algorithm with variable queue length. At the latter part of paper, it proves that this new kind of RED algorithm is more effective, fair and able to cope with burst messages.