Distributed WFQ scheduling converging to weighted max-min fairness

DOI10.1016/J.COMNET.2010.10.011MaRDI QIDQ2431460zbMATH OpenOpenAlexFDO

Authors Nikolaos Chrysos, Manolis Katevenis

Publication date 14 April 2011

Published in Computer Networks (Search for Journal in Brave)

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

zbMATH Keywords

distributed WFQ schedulingfairnessQoSswitching networks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• WF\(^{2}\)Q-M: worst-case fair weighted fair queueing with maximum rate control
• A queueing analysis of max-min fairness, proportional fairness and balanced fairness
• Network stability under max-min fair bandwidth sharing
• How fair is fair queuing
• A queueing analysis of data networks

Cited in

(5)

• Analysis of a two-class single-server discrete-time FCFS queue: the effect of interclass correlation
• A simple approximation for the response times in the two-class weighted fair queueing system
• A distributed DiffServ supporting scheduling algorithm
• Timeslot-reservation based weighted fair scheduling
• WF\(^{2}\)Q-M: worst-case fair weighted fair queueing with maximum rate control

This page was built for publication: Distributed WFQ scheduling converging to weighted max-min fairness

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