An efficient Round Robin scheduling algorithm for DiffServ networks

There have been a lot of studies on designing scheduling algorithms for differentiated service (DiffServ) networks. In this context three important issues have to be considered: simplicity, fairness and priority-based services. This paper introduces an efficient flow-based scheduling algorithm, called DS-DRR, for DiffServ networks. By adopting appropriate sorting strategies, this approach can provide low latencies for traffic of high priorities. Moreover, this scheme inherits advantages Such as simplicity and fairness from traditional Deficit Round Robin schemes. Performance 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.