基于优先级的CHOKe算法仿真与性能分析  

Simulation and Performance Analysis for CHOKe Algorithm Based on Priority

作　　者：鲁凌云[1] 李婷婷 

机构地区：[1]北京交通大学计算机与信息技术学院,北京100044

出　　处：《计算机工程》2017年第9期75-80,共6页Computer Engineering

基　　金：国家自然科学基金(61201200);中央高校基本科研业务费专项资金(2017JBM025)

摘　　要：为将区分服务(DiffServ)网络架构中的优先级服务与网络拥塞控制相结合,提出一种应用于DiffServ架构核心路由器的CHOKe算法(CHOKeW)。针对不同优先级别的数据流进行带宽分区,为高优先级的数据流分配高带宽,并且当发生网络拥塞时通过限制高速非响应流占用的带宽,达到保护响应流的同时兼顾相同优先级数据流公平性的目的。实验使用NS-2建立仿真模型,分析CHOKeW算法、加权公平队列算法、RIO算法的不同优先级混合流的带宽公平分配情况,结果表明,CHOKeW算法能够有效提高网络性能,保证网络服务质量。In order to combine the priority service of DiffServ with network congestion control,a Choose and Keep for responsive flows Choose and Kill for unresponsive flows（ CHOKe） algorithm（ CHOKeW） which can be applied to the Differentiated Services（ DiffServ） architecture core router is proposed, called CHOKeW. Allocate high bandwidth for high priority flows for bandwidth allocation at different priority levels,and when the network congestion occurs,limiting the bandwidth occupied by the UDP flow to protect the TCP flow which achieving the fairness of flow with the same priority. In this paper,the simulation model is established by NS-2, and the bandwidth allocation of CHOKeW algorithm,weighted fair queuing algorithm and Random Early Detection（ RED） with In and Out（ RIO） algorithm is analyzed. The results show that CHOKeW algorithm can effectively improve the network performance,ensure the quality of network service, and solve the problem of bandwidth allocation based on fairness and priority.

关 键 词：主动队列管理 随机早期检测 加权公平队列 CHOKeW算法 区分服务 

分 类 号：TN915.01[电子电信—通信与信息系统]