VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
Journal of the ACM (JACM)
IEEE/ACM Transactions on Networking (TON)
Time-shift scheduling—fair scheduling of flows in high-speed networks
IEEE/ACM Transactions on Networking (TON)
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
Supporting best-effort traffic with fair service curve
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services
IEEE/ACM Transactions on Networking (TON)
Fair and Efficient Packet Scheduling Using Elastic Round Robin
IEEE Transactions on Parallel and Distributed Systems
Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delay and Throughput Fairness
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Scheduling for quality of service guarantees via service curves
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Start-Time Fair Queuing: A Scheduling Algorithm for Integrated ServicesPacket Switching Networks
Start-Time Fair Queuing: A Scheduling Algorithm for Integrated ServicesPacket Switching Networks
Xen and the art of virtualization
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Greedy Fair Queueing: A Goal-Oriented Strategy for Fair Real-Time Packet Scheduling
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Deploying IP and MPLS QoS for Multiservice Networks: Theory & Practice
Deploying IP and MPLS QoS for Multiservice Networks: Theory & Practice
pClock: an arrival curve based approach for QoS guarantees in shared storage systems
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Hi-index | 0.00 |
Fair-queuing schedulers provide clients with bandwidth or latency guarantees provided they are well-behaved i.e.the requested service is always within strict predefined limits. Violation of the service bounds results in nullification of the performance guarantees of the misbehaving client.In this paper we relax this notion of good behavior and present a generalized service model that takes the current system load into consideration. Consequently clients may opportunistically consume more than their contracted service without losing future performance guarantees, if doing so will not penalize well-behaved clients. We present a new algorithm RFQ (Redemptive Fair Queuing) along with a generalized traffic model called the Deficit Token Bucket (DTB). RFQ incorporates the notion of redemption, whereby a misbehaving client may be rejuvenated and regain its performance guarantees. We characterize the conditions for rejuvenating a client, and prove that RFQ meets its performance guarantees in the DTB model.