Proportional Nested Deficit Round Robin: Improving the Latency of Packet Scheduler with an O(1) Complexity

Afshin Shiravi, Yoon G. Kim, Paul S. Min. Proportional Nested Deficit Round Robin: Improving the Latency of Packet Scheduler with an O(1) Complexity. In First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (AAA-IDEA 2005), 15 June 2005, Orlando, Florida, USA. pages 34-41, IEEE Computer Society, 2005. [doi]

@inproceedings{ShiraviKM05,
  title = {Proportional Nested Deficit Round Robin: Improving the Latency of Packet Scheduler with an O(1) Complexity},
  author = {Afshin Shiravi and Yoon G. Kim and Paul S. Min},
  year = {2005},
  doi = {10.1109/AAA-IDEA.2005.14},
  url = {http://doi.ieeecomputersociety.org/10.1109/AAA-IDEA.2005.14},
  researchr = {https://researchr.org/publication/ShiraviKM05},
  cites = {0},
  citedby = {0},
  pages = {34-41},
  booktitle = {First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (AAA-IDEA 2005), 15 June 2005, Orlando, Florida, USA},
  publisher = {IEEE Computer Society},
  isbn = {0-7695-2525-3},
}