机构地区: 中南大学信息科学与工程学院
出 处: 《微电子学与计算机》 2005年第7期36-41,共6页
摘 要: 主动队列管理是实现网络拥塞控制的一种重要技术,但是多数主动队列算法如RED等对于公平性的考虑不足。近年来,也出现了一些能提供一定的公平性支持的主动队列管理算法,本文对其中几个有代表性的算法进行了对比研究。包括对它们的理论分析,以及在ns2上的仿真实验,并且结合实验结果对算法中存在的问题及其原因进行了深入的分析。文中最后对这几种算法进行了综合的评价,并对算法的改进提出了一些建议,希望能为今后的工作提供一定的支持。 Active queue management plays an important role in congestion control of network. But most of active queue management algorithms, such as RED, etc. are lack of fairness. Recently, several active queue management algorithms that can support fairness were proposed. In this paper, four classic fair active queue management algorithms arc selected to do a comparison. The comparison includes theoretical analysis and simulation in ns2. Moreover, the shortcomings and the probable causes are also given an in-depth analysis. The integrative assessment is given at the end of this paper; hoping to give support for future's research.
领 域: [自动化与计算机技术] [自动化与计算机技术]