Fair scheduling with tunable latency: a round-robin approach

@article{Chaskar2003FairSW,
  title={Fair scheduling with tunable latency: a round-robin approach},
  author={Hemant M. Chaskar and Upamanyu Madhow},
  journal={IEEE/ACM Trans. Netw.},
  year={2003},
  volume={11},
  pages={592-601}
}
Weighted fair queueing (WFQ)-based packet scheduling schemes require processing at line speeds for tag computation and tag sorting. This requirement presents a bottleneck for their implementation at high transmission speeds. In this paper, we propose an alternative and lower complexity approach to packet scheduling, based on modifications of the classical round-robin scheduler. Contrary to conventional belief, we show that appropriate modifications of the weighted round-robin (WRR) service… CONTINUE READING
Highly Cited
This paper has 128 citations. REVIEW CITATIONS
76 Citations
5 References
Similar Papers

Citations

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

128 Citations

051015'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 128 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…