WF^2Q-M: worst-case fair weighted fair queueing with maximum rate control

DOI10.1016/J.COMNET.2006.07.013zbMATH Open1108.68021OpenAlexW2032430243MaRDI QIDQ870366FDOQ870366

Authors Jeng Farn Lee, Yeali S. Sun, Meng-Chang Chen

Publication date 12 March 2007

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comnet.2006.07.013

zbMATH Keywords

schedulingQoSrate controlweighted fair

Mathematics Subject Classification ID

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

Recommendations

• Distributed WFQ scheduling converging to weighted max-min fairness
• Quality-of-service guarantees architecture with weighted fair shaping
• Rainbow fair queueing: theory and applications
• Integrating priority with share in the priority-based weighted fair queuing scheduler for real-time networks
• A simple approximation for the response times in the two-class weighted fair queueing system

Cited in

(9)

• RFQ: Redemptive Fair Queuing
• Distributed WFQ scheduling converging to weighted max-min fairness
• Integrating priority with share in the priority-based weighted fair queuing scheduler for real-time networks
• Timeslot-reservation based weighted fair scheduling
• A simple approximation for the response times in the two-class weighted fair queueing system
• Analytical model of a weighted round robin service system
• Timeslot weighted fair scheduling in EPFTS
• An accumulation-based, closed-loop scheme for expected minimum rate and weighted rate services
• Deterministic time-varying packet fair queueing for integrated services networks

This page was built for publication: WF\(^{2}\)Q-M: worst-case fair weighted fair queueing with maximum rate control

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