N次弃头的被动队列管理算法  

Passive Queue Management Algorithm Based on Dropping Front N Times

作　　者：姜文刚[1,2] 孙金生[1] 王执铨[1] 

机构地区：[1]南京理工大学自动化学院,南京210094 [2]江苏科技大学电子信息学院,江苏镇江212003

出　　处：《小型微型计算机系统》2011年第9期1849-1853,共5页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60974129)资助;江苏省"青蓝工程"资助

摘　　要：主动队列管理算法存在参数设置敏感,响应相对滞后于实际网络状况的缺陷,并没有在实际网络上推广使用,因此对目前使用最多的弃尾被动队列管理进行改进,提出N次弃头的被动队列管理算法,在队列满时,从队列头部丢弃N个数据包,N为大于等于2的整数.该算法改善了弃尾队列管理的缺陷,提高了网络传输性能,能有效改善RTT公平性和速度公平性,算法计算量小,最后通过NS2仿真验证该算法的有效性.Active queue management is sensitive to parameter settings, and the response lags behind the actual network conditions, so it has not promote the use of the actual network. Therefore, in order to improve drop tail passive queue management, which is most widely used, passive queue management algorithm based on dropping front N times is proposed. When the queue is full, dropping packet N times in the front of queue, N is an integer greater than or equal to 2. The algorithm improves the defects of drop tail, and improves the network transrmission performance. Passive queue management algorithm based on dropping front N times can effectively improve the RTT fairness and fairness of speed; Computation of this algorithm is small. Finally, NS2 simulation results show the effectiveness of the algorithm.

关 键 词：N次弃头 被动队列管理 弃尾 网络拥塞控制 主动队列管理 

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