RFQ: Redemptive Fair Queuing

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.

[1]  Desmond P. Taylor,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The SingleNode Case , 2007 .

[2]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[3]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[4]  Harish Sethu,et al.  Greedy fair queueing: a goal-oriented strategy for fair real-time packet scheduling , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[5]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM 1996.

[6]  George Varghese,et al.  Leap forward virtual clock: a new fair queuing scheme with guaranteed delays and throughput fairness , 1997, Proceedings of INFOCOM '97.

[7]  Lixia Zhang.  VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks , 1991, ACM Trans. Comput. Syst..

[8]  George Varghese,et al.  Leap forward virtual clock: a new fair queuing scheme with guaranteed delays and throughput fairness , 1997, PODC '97.

[9]  Ion Stoica,et al.  A hierarchical fair service curve algorithm for link-sharing, real-time and priority services , 1997, SIGCOMM '97.

[10]  T.S. Eugene Ng,et al.  Supporting best-effort traffic with fair service curve , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[11]  Bruce S. Davie,et al.  Deploying IP and MPLS QoS for Multiservice Networks: Theory & Practice , 2007 .

[12]  Peter J. Varman,et al.  pClock: an arrival curve based approach for QoS guarantees in shared storage systems , 2007, SIGMETRICS '07.

[13]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[14]  George C. Polyzos,et al.  Scheduling for quality of service guarantees via service curves , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[15]  Mohamed G. Gouda,et al.  Time-shift scheduling—fair scheduling of flows in high-speed networks , 1998, TNET.

[16]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM '96.

[17]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[18]  Carl A. Waldspurger,et al.  Memory resource management in VMware ESX server , 2002, OSDI '02.

[19]  Rene L. Cruz,et al.  Quality of Service Guarantees in Virtual Circuit Switched Networks , 1995, IEEE J. Sel. Areas Commun..

[20]  Albert G. Greenberg,et al.  How fair is fair queuing , 1992, JACM.

[21]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[22]  Salil S. Kanhere,et al.  Fair and Efficient Packet Scheduling Using Elastic Round Robin , 2002, IEEE Trans. Parallel Distributed Syst..