基于CSFQ的路由器带宽公平性算法的改进研究  

Research and Development of the Fair Bandwidth Allocation Algorithm for Router of the Network Base on CSFQ

作　　者：林婧[1] 唐继勇[1] 王佐成[2] 邓亚平[3] 

机构地区：[1]重庆电子工程职业学院计算机应用系,重庆401331 [2]重庆邮电大学软件学院,重庆400065 [3]重庆邮电大学计算机学院,重庆400065

出　　处：《西南师范大学学报（自然科学版）》2011年第5期67-73,共7页Journal of Southwest China Normal University(Natural Science Edition)

基　　金：重庆邮电大学博士科研启动基金资助项目(A2008-14;A2008-15);中国博士后科学基金资助项目(20090450219)

摘　　要：针对核心无状态公平队列调度(CSFQ)的丢包算法不适用于TCP流的问题,提出了一种改进算法my-CS-FQ,能够根据网络状况动态地调整TCP流和UDP流各自的丢包行为,解决TCP流与UDP流的带宽分配公平性.大量仿真实验结果表明my-CSFQ算法能够提高TCP流同UDP流竞争网络资源的能力,更有效地利用链路带宽,提高网络流之间的公平性.CSFQ（core stateless fair queuing） can achieve as well fairness in bandwidth allocation as that implemented by stateful networks.However,its dropping algorithm is derived from non-responsive flows such as UDP flows,and does not suit TCP flows.In accordance with the drawback,the paper proposed a method that can enhance CSFQ algorithm,which dynamically can regular the dropping probability based on network condition among TCP flows and UDP flows,the fairness of bandwidth allocations between TCP and UDP is well achieved.With large amount of simulation experiments,the results show CSFQ algorithm outperforms the original CSFQ algorithm by a significant margin in bandwidth allocation fairness when TCP flows competed with greedy UDP flows.

关 键 词：服务质量 公平性 主动队列管理 核心无状态公平队列 

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