AQM算法在公平性方面的研究  

Study of AQM algorithms based on fairness

作　　者：吴清[1] 王怀彬[1] 张岩[1] 

机构地区：[1]天津理工大学计算机科学与技术学院,天津300191

出　　处：《天津理工大学学报》2008年第1期42-45,共4页Journal of Tianjin University of Technology

基　　金：教育部科学技术研究重点项目(地方03010)

摘　　要：主动队列管理是实现网络拥塞控制的一种重要技术.近年来,出现了一些新的主动队列管理算法.这些新算法针对大多数主动队列管理算法对公平性考虑不足的问题在一定程度上进行了改进,对公平性提供了一定的支持.本文对其中两个有代表性FRED和CHOKe算法进行了对比研究及理论分析,结合在ns2上的仿真实验结果对算法中存在的问题及其原因进行了深入的分析.最后对算法进行了综合的评价,并给出了对算法的改进建议.Active Queue Management plays an important role in congestion control of network. Recently, several active queue management algorithms were proposed. These new algorithms improve the former active queue management algorithms which are lack of fairness, these new algorithms can support fairness. In this paper, two classic fair active queue management algorithms FRED and CHOKe are selected to do a comparison and theoretical analysis. The shortcomings of the algorithms and the probable causes are also given an in - depth analysis based on the simulation results in ns2 . The integrative assessment and some ameliorative suggestions are given at the end of this paper.

关 键 词：主动队列管理 公平性 带宽 TCP流 UDP流 

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