IEEE/ACM Transactions on Networking (TON)
Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Computer networks (3rd ed.)
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Fair scheduling in wireless packet networks
IEEE/ACM Transactions on Networking (TON)
Introduction to Algorithms
Earliest Eligible Virtual Deadline First : A Flexible and Accurate Mechanism for Proportional Share Resource Allocation
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy
Information Processing Letters
Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy
Information Processing Letters
| Hi-index | 0.00 |
While exisiting weighted fair scheduling schemes guaranteeminimum service rates of a shared server (such as a computeror a communication channel), maximum rate control wasgenerally enforced by employing policing mechanisms. Theprevious approaches use either a concatenation of ratecontroller and scheduler, or a policer in front of scheduler.The concatenation method uses two sets of queues andmanagement aparartus, and thus incurs overhead. The othermethod allows bursty job requests that may violatemaximum rate constraint. In this paper, we present a newweighted fair scheduling scheme, WF2Q-M, to simultaneouslysupport maximum rate control and minimum service rateguarantee. WF2Q-M proposes the virtual clock adjustmentmethod to enforce maximum rate control by distributing theexcess bandwidths of maximum rate constrained sessions toother sessions without recalculating the virtual starting andfinishing times of regular sessions. In terms of performancemetrics, we prove that WF2Q-M is theoretically bounded bya fluid reference model. A procedural schedulingimplementation of WF2Q-M is proposed and proof ofcorrectness is given. Finally, we conduct extensiveexperiments to show the performance of WF2Q-M is just as weclaim.