Introduction to algorithms
A stop-and-go queueing framework for congestion management
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
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
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Fair scheduling in wireless packet networks
IEEE/ACM Transactions on Networking (TON)
Computer Networks
General Methodology for Designing Efficient Traffic Scheduling and Shaping Algorithms
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
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
Scalable architectures for integrated traffic shaping and link scheduling in high-speed ATM switches
IEEE Journal on Selected Areas in Communications
Real-time optimization flow control
Computer Networks: The International Journal of Computer and Telecommunications Networking
A comprehensive analytical model for weighted fair queuing under multi-class self-similar traffic
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A user-decided service model and resource management in a cooperative WiMAX/HSDPA network
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
| Hi-index | 0.00 |
While existing weighted fair scheduling schemes guarantee minimum bandwidths/resources for the classes/processes of a shared channel, the maximum rate control, which is critical to service providers, carriers, and network managers for resource management and business strategies in many applications, is generally enforced by employing traffic policing mechanisms. These approaches use either a concatenation of the rate controller and scheduler, or a policer in front of the scheduler. The concatenation method uses two sets of queues and a management apparatus that incurs overhead. The latter method may allow bursty traffic to pass through the controller, which violates the maximum rate constraint, or results in packet loss. In this paper, we present a new weighted fair scheduling scheme, WF^2Q-M, which can simultaneously support maximum rate control and minimum service rate guarantees. WF^2Q-M uses the virtual clock adjustment method to enforce maximum rate control and distribute the excess bandwidths of saturated sessions to other sessions without recalculating the virtual starting and finishing times of sessions. In terms of performance, we prove that WF^2Q-M is theoretically bounded by a corresponding fluid reference model. A procedural scheduling implementation of WF^2Q-M is proposed, and a proof of correctness is given. Finally, we present the results of extensive experiments to show that the performance of WF^2Q-M is just as claimed.