Fair Round-Robin: A Low Complexity Packet Schduler with Proportional and Worst-Case Fairness

@article{Yuan2009FairRA,
  title={Fair Round-Robin: A Low Complexity Packet Schduler with Proportional and Worst-Case Fairness},
  author={Xin Yuan and Zhenhai Duan},
  journal={IEEE Transactions on Computers},
  year={2009},
  volume={58},
  pages={365-379}
}
Round robin based packet schedulers generally have a low complexity and provide long-term fairness. The main limitation of such schemes is that they do not support short-term fairness. In this paper, we propose a new low complexity round robin scheduler, called Fair Round Robin (FRR), that overcomes this limitation. FRR has similar complexity and long-term fairness properties as the stratified round robin scheduler, a recently proposed scheme that arguably provides the best quality-of-service… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Improving the Fairness and Complexity of Packet Scheduling.

  • B. Caprita, J. Nieh, W. Chan, “Group Round Robin
  • Proceedings of the 2005 Symposium on Architecture…
  • 2005
2 Excerpts

Similar Papers

Loading similar papers…