An Efficient Round Robin Scheduling Algorithm for DiffServ Networks

作     者：Gongchao Su Xiaohui Lin and Hui Wang College of Information Engineering Shenzhen University Shenzhen Guangdong Province P.R.China 

会议名称：《2006年国际电子、工程及科学领域的分布式计算和应用学...》

会议日期：2006年

学科分类：08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by Nature ScienceFoundation of Guangdong Province(No.5010494) ShenzhenSci and Tech.Plan(No.200334) 

关 键 词：Differentiated Service Scheduling Round Robin Service Priority Latency 

摘      要：正There have been a lot of studies on designing scheduling algorithms for differentiated service（DiffServ） *** this context three important issues have to be considered: simplicity,fairness and priority-based *** paper introduces an efficient flow-based scheduling algorithm, called DS-DRR,for DiffServ *** adopting appropriate sorting strategies,this approach can provide low latencies for traffic of high ***,this scheme inherits advantages such as simplicity and fairness from traditional Deficit Round Robin *** analysis and simulation results show that this scheme ensures strict priority-based services under dynamic network scenarios,while maintaining fairness for traffic of all priority service classes.