Approximation of generalized processor sharing with interleaved stratified timer wheels
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In this paper, we propose a novel grouping strategy of group round robin and an O(1) complexity scheduling algorithm called virtual weighted queue group round robin. Simulation and implementation experiments show that our algorithm can provide better end-to-end delay than traditional group round robin.