DiffServ网络中一种改进的round robin公平加权调度算法  

A Novel Fair Weighted Round Robin Scheduling Scheme for DiffServ Networks

作　　者：杜建辉[1] 

机构地区：[1]解放军理工大学通信工程学院研究生5队,南京210007

出　　处：《现代有线传输》2005年第6期48-50,72,共4页

摘　　要：文中提出了DiffServ网络中一种改进的公平加权round robin调度算法。该算法在网络发生拥塞时,根据各优先业务 类的不同服务等级,动态地改变各优先业务类的调度权重,并同时保持了各优先业务类的相对公平性。通过仿真显 示,该算法在适度满足尽力服务类的同时,能有效处理不同业务类的突发数据,比较迅速地缓解网络的拥塞状况。A novel weighted round robin scheduling scheme fur differentiated service networks is presented in the paper. When the network is congested. the weight of cach service class can be changed adaptively according to the different priority, and the relative fairness for all priority scrvice classes is maimaincd meanwhile. The simulation result indicates that the scheme can deal with the data bursts and network congcstion well and is modcrate for the best effort service.

关 键 词：区分服务 优先队列调度 加权轮叫调度 

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