改进的基于CHOKe击中历史的公平主动式队列管理  

Improved equal AQM based on CHOKe hits

作　　者：姜明[1] 边浩[1] 张少丽[2] 

机构地区：[1]杭州电子科技大学软件与智能技术研究所,杭州310018 [2]杭州电子科技大学图形图像研究所,杭州310018

出　　处：《计算机应用》2010年第2期289-291,共3页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60773182)

摘　　要：带宽公平分配问题一直是网络的热点研究问题。改进的算法New-XCHOKe自适应地根据网络拥塞程度决定分组数量并将取出分组与到达分组比较,以CHOKe击中次数来识别非适应流,并以提前丢包的方式对其进行惩罚,从而保障网络中各种流之间公平地分享带宽。NS-2的仿真实验结果显示New-XCHOKe在惩罚非适应流、维护网络带宽公平分配上性能优于CHOKe、XCHOKe等其他几种算法。Fair allocation of bandwidth is always a hot research issue of networks. Under different level of network congestion, New-XCHOKe calculated the number of packets picked from queue self-adaptively, and then compared them. New-XCHOKe identified non-adaptive flows by the CHOKe hits, and punished the non-adaptive flows by dropping their packets first to ensure the fairness of bandwidth allocation between different flows. The simulation results about New-XCHOKe and other main schemes by using NS-2 show that New-XCHOKe performs better than XCHOKe and CHOKe in punishing nonadaptive flows and allocating bandwidth fairly.

关 键 词：主动队列管理 非适应流 适应流 XCHOKe CHOKE 

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