Evaluation of surplus round robin scheduling algorithm
Dessislava Nikolova, Chris L. Blondia · 2006
In multi-service packet networks the packet scheduling algorithm plays a key role in delivering guaranteed service to different flows. In this article we evaluate surplus round robin (SRR) scheduling algorithm. We apply the Latency-Rate (LR) servers theory in order to obtain bounds on the latency and delay provided by the algorithm. We compare the performance characteristics of SRR with the popular deficit round robin (DRR) algorithm to conclude that SRR can provide better performance than DRR. 1