S-CHOKe:一种增强CHOKe公平性的主动式队列管理算法  

S-CHOKe:An AQM Algorithm for Enhances the Fairness of the CHOKe

作　　者：龚静[1] 吴春明[2] 

机构地区：[1]铜仁学院计算机科学系,贵州铜仁554300 [2]浙江大学人工智能研究所,浙江杭州310027

出　　处：《电子学报》2010年第5期1100-1104,共5页Acta Electronica Sinica

基　　金：国家自然科学基金(No.60773182);"863"重大项目课题(No.2008AA01A323)

摘　　要：CHOKe是一种无状态的近似公平的主动式队列管理算法,利用CHOKe击中能近似识别并惩罚非响应流,CHOKe击中的有效性以及惩罚非响应流的力度,是提高算法公平性的关键因素.本文提出了一种增强CHOKe公平性的算法S-CHOKe,以采样击中取代CHOKe击中,提高CHOKe击中的有效性;利用队列击中,自适应确定丢包数,适度惩罚非响应流.仿真实验表明,S-CHOKe能适应流数量变化,是有效的、公平的.CHOKe is an algorithm of fair approximation of the stateless and active queue management. The CHOKe hit, whose effectiveness and the force of punishing non-response flows are the crucial factors to enhance the fairness algorithm,is used to approximately identify and punish non-response flows. In this paper a new algorithm, S-CHOKe, which enhances the fairness of the CHOKe algorithm,not only replace the CHOKe hit with sampling CHOKe hit to improve the effectiveness of CHOKe hit,but also use Queue hit to adaptively determine the number of packet loss so to moderately punish non-response flows. Simulation results show that S-CHOKe, which is able to adapt to changes in flow quantity,is effective and fair.

关 键 词：拥塞控制 主动式队列管理 CHOKE S-CHOKe 

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