A fair service and dynamic round robin scheduling algorithm

DOI10.3724/SP.J.1001.2008.01856MaRDI QIDQ3406363zbMATH OpenFDO

Authors Hongchao Hu, Peng Yi, Yu-Feng Li, Yun-Fei Guo

Publication date 12 February 2010

Published in Journal of Software (Search for Journal in Brave)

zbMATH Keywords

scheduling policyswitching fabricdynamic round robin

Mathematics Subject Classification ID

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

Recommendations

• Approximate sorting of packet-scheduling in high-speed networks
• scientific article; zbMATH DE number 2165697
• scientific article; zbMATH DE number 6500421
• scientific article; zbMATH DE number 2088452
• Instant Service Policy and Its Application to Deficit Round Robin

Cited in

(11)

• Approximate sorting of packet-scheduling in high-speed networks
• Anchored opportunity queueing: a low-latency scheduler for fair arbitration among virtual channels.
• A distributed DiffServ supporting scheduling algorithm
• scientific article; zbMATH DE number 2088452 (Why is no real title available?)
• Achieving fair service with a hybrid scheduling scheme for CICQ switches
• Instant Service Policy and Its Application to Deficit Round Robin
• The efficiency-fairness balance of round robin scheduling
• Timeslot-reservation based weighted fair scheduling
• scientific article; zbMATH DE number 2165697 (Why is no real title available?)
• A fair scheduling discipline for Ethernet passive optical networks
• Timeslot weighted fair scheduling in EPFTS

This page was built for publication: A fair service and dynamic round robin scheduling algorithm

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