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

DOI10.1109/TC.2008.176MaRDI QIDQ4974997zbMATH OpenOpenAlexFDO

Authors Xin Yuan, Zhenhai Duan

Publication date 8 August 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2008.176

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited in

(2)

• scientific article; zbMATH DE number 6500421 (Why is no real title available?)
• Achieving fair service with a hybrid scheduling scheme for CICQ switches

This page was built for publication: Fair Round-Robin: A Low Complexity Packet Schduler with Proportional and Worst-Case Fairness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4974997)