Fair , Efficient and Low-Latency Packet Scheduling Using Nested Deficit Round

@inproceedings{Kanhere2001FairE,
  title={Fair , Efficient and Low-Latency Packet Scheduling Using Nested Deficit Round},
  author={Salil S. Kanhere and Harish Sethu},
  year={2001}
}
In the emerging high-speed integrated-services packetswitched networks, packet scheduling algorithms in switches and routers play a critical role in providing the Quality-of-Service (QoS) guarantees required by many applications. In this paper, we present a new scheduling discipline called Nested Deficit Round Robin (Nested-DRR), which is fair, efficient and in addition has a low latency bound. Nested-DRR splits each DRR round into one or more smaller rounds, within each of which we run a… CONTINUE READING
Highly Cited
This paper has 56 citations. REVIEW CITATIONS

Citations

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

57 Citations

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

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Traffic scheduling in packet-switched networks: analysis, design, and implementation

  • D. Stiliadis, A. Verma
  • Ph.D dissertation, University of Santa Cruz…
  • 1996
1 Excerpt

Design and analysis of a fair queuing algorithm

  • A. Demers, S. Keshav, S. Shenker
  • Proceedings of ACM SIGCOMM, pp. 1-12, Austin, TX…
  • 1989
2 Excerpts

Similar Papers

Loading similar papers…