摘要
文中提出了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.
