主动队列管理算法的性能分析
Analyzing the Performance of Active Queue Management Algorithms
摘要：
拥塞是传输控制协议（TCP）网络环境中研究人员关注的一个重要问题。为了保证整个网络的稳定性，拥塞控制算法得到了广泛的研究。路由器采用的队列管理方法是拥塞控制研究的重要内容之一。主动队列管理（AQM）是一种基于路由器的拥塞早期检测机制。本文分析了几种主动队列管理算法在保持高资源利用率、识别和限制不均衡带宽使用的能力以及部署复杂性。我们比较了性能的FRED，蓝色，SFB，和CHOKe的仿真结果的基础上，使用RED和Drop Tail作为评估基准。对不同算法的特点进行了讨论和比较。利用网络仿真器NS 2进行了仿真，并用X图绘制了仿真图.
英文摘要：
Congestion is an important issue which researchers focus on in the Transmission Control Protocol (TCP) network environment. To keep the stability of the whole network, congestion control algorithms have been extensively studied. Queue management method employed by the routers is one of the important issues in the congestion control study. Active queue management (AQM) has been proposed as a router-based mechanism for early detection of congestion inside the network. In this paper we analyzed several active queue management algorithms with respect to their abilities of maintaining high resource utilization, identifying and restricting disproportionate bandwidth usage, and their deployment complexity. We compare the performance of FRED, BLUE, SFB, and CHOKe based on simulation results, using RED and Drop Tail as the evaluation baseline. The characteristics of different algorithms are also discussed and compared. Simulation is done by using Network Simulator(NS2) and the graphs are drawn using X- graph.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
