一种基于平均数据包长度的可变权值调度算法  

Variable Weight Scheduling Algorithm Based on Average Packet Length

作　　者：李寅[1] 周井泉[1] 

机构地区：[1]南京邮电大学电子科学与工程学院,江苏南京210003

出　　处：《计算机技术与发展》2012年第9期116-118,122,共4页Computer Technology and Development

基　　金：国家"863"高技术发展计划项目(2009AA01Z202)

摘　　要：近年来随着网络规模的扩大,一些对实时性要求较高的音频、视频业务的出现,对网络QoS保证提出了更高的要求。在区分服务下,分组调度技术是保证网络QoS的核心技术,也是实现网络拥塞控制管理,保证各业务带宽分配公平性的必要手段。调度算法是保证网络服务质量(QoS)的核心技术,传统轮询调度WRR算法存在一个公平性问题,并不适用于数据包长度可变的网络。文中基于WRR算法提出一种改进算法,使其可以依据平均数据包长度自适应地改变权值,命名为CWRR。并通过仿真对新算法性能进行分析,如果测量区间是合适的,那么CWRR的公平性比WRR要好。Tbe requirements of QoS are getting higher because of the network expansion and the advent of andios and videos with high real-time requirements. In differentiated service model, the packet scheduling technique is a core of guaranteeing the QoS. It can also be used to control the network congestion and ensure the fairness of the bandwidth allocation. Scheduling algorithm is the core technology to ensure quality of service （ QoS ）, and the traditional round-robin scheduling WRR has a fairness problem, so it can not be applied to variable-length packet network. It proposed an improved algorithm, based on WRR, named CWRR. In CWRR, the weight of the WRR （ Weighted Round Robin ） muter varies adaptively depending on the average packet length. Additionally, through the simulation analysis of the performance of the new algorithm, it is shown that the fairness of CWRR becomes better than WRIt if the measurement interval is appropriately determined.

关 键 词：轮询调度 带宽 测量区间 公平性 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]