Three new approaches for adjustment and improvement of the RR scheduler in a dynamic resource environment

Their relative fairness along with the delay bounds are derived. Simulation experiments support the algorithms' significance and useful results are also provided in comparison with other scheduling algorithms. This kind of algorithms can be applied for next generation internet routers, achieving short time service for delay sensitive flows.