Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
VMware, Inc.: Introduction to VMware Infrastructure (2007), http://www.vmware.com/support/pubs/
Barham, P., Dragovic, B., Fraser, K., Hand, S., Harris, T., Ho, A., Neugebauer, R., Pratt, I., Warfield, A.: Xen and the art of virtualization. In: SOSP 2003: Proceedings of the nineteenth ACM symposium on Operating systems principles, pp. 164–177. ACM, New York (2003)
Waldspurger, C.: Memory resource management in vmware esx server (2002)
Sariowan, H., Cruz, R.L., Polyzos, G.C.: Scheduling for quality of service guarantees via service curves. In: Proceedings of the International Conference on Computer Communications and Networks, pp. 512–520 (1995)
Cruz, R.L.: Quality of service guarantees in virtual circuit switched networks. IEEE Journal on Selected Areas in Communications 13(6), 1048–1056 (1995)
Gulati, A., Merchant, A., Varman, P.: pClock: An arrival curve based approach for QoS guarantees in shared storage systems. In: Proceedings of the 2007 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 13–24. ACM Press, New York (2007)
Evans, J., Filsfils, C.: Deploying IP and MPLS QoS for multiservice networks. Morgan Kaufmann, San Francisco (2007)
Bennett, J.C.R., Zhang, H.: WF2Q: Worst-case fair weighted fair queueing. INFOCOM (1), 120–128 (1996)
Parekh, A.K., Gallager, R.G.: A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans. Netw. 1(3), 344–357 (1993)
Zhang, L.: VirtualClock: A new traffic control algorithm for packet-switched networks. ACM Trans. Comput. Syst. 9(2), 101–124
Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queuing algorithm. Journal of Internetworking Research and Experience 1(1), 3–26 (1990)
Greenberg, A.G., Madras, N.: How fair is fair queuing. J. ACM 39(3), 568–598 (1992)
Goyal, P., Vin, H.M., Cheng, H.: Start-time fair queuing: A scheduling algorithm for integrated services packet switching networks. Technical Report CS-TR-96-02, UT Austin (January 1996)
Golestani, S.: A self-clocked fair queueing scheme for broadband applications. In: INFOCOMM 1994, pp. 636–646 (April 1994)
Suri, S., Varghese, G., Chandramenon, G.: Leap forward virtual clock: A new fair queueing scheme with guaranteed delay and throughput fairness. In: INFOCOMM 1997 (April 1997)
Stiliadis, D., Varma, A.: Latency-rate servers: a general model for analysis of traffic scheduling algorithms. IEEE/ACM Transactions on Networking 6(5), 611–624 (1998)
Shi, H., Sethu, H.: Greedy fair queueing: A goal-oriented strategy for fair real-time packet scheduling. In: RTSS 2003: Proceedings of the 24th IEEE International Real-Time Systems Symposium, Washington, DC, USA, p. 345. IEEE Computer Society, Los Alamitos (2003)
Kanhere, S.S., Sethu, H., Parekh, A.B.: Fair and efficient packet scheduling using elastic round robin. IEEE Trans. Parallel Distrib. Syst. 13(3), 324–336 (2002)
Cobb, J.A., Gouda, M.G., El-Nahas, A.: Time-shift scheduling—fair scheduling of flows in high-speed networks. IEEE/ACM Trans. Netw. 6(3), 274–285 (1998)
Stoica, I., Zhang, H., Ng, T.S.E.: A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services. IEEE/ACM Trans. Netw. 8(2), 185–199 (2000)
Ng, T.S.E., Stephens, D.C., Stoica, I., Zhang, H.: Supporting best-effort traffic with fair service curve. In: Measurement and Modeling of Computer Systems, pp. 218–219 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gulati, A., Varman, P. (2008). RFQ: Redemptive Fair Queuing . In: Halperin, D., Mehlhorn, K. (eds) Algorithms - ESA 2008. ESA 2008. Lecture Notes in Computer Science, vol 5193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87744-8_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-87744-8_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87743-1
Online ISBN: 978-3-540-87744-8
eBook Packages: Computer ScienceComputer Science (R0)