Abstract
In this paper, we study resource management models and algorithms that satisfy multiple performance objects simultaneously. We realize the proportional fairness principle based QoS model, which defines both delay and loss rate requirements of a class, to include fairness, which is important for the integration of multiple service classes. The resulting Proportional Fairness Scheduling model formalizes the goals of the network performance, user’s QoS requirement and system fairness and exposes the fundamental tradeoffs between these goals. In particular, it is difficult to simultaneously provide these objects. We propose a novel scheduling algorithm called Proportional Fairness Scheduling (PFS) that approximates the model closely and efficiently. We have implemented the PFS scheduling in Linux. By performing simulation and measurement experiments, we evaluate the delay and loss rate proportional fairness of PFS, and determine the computation overhead.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Jiang, Y., Lin, C., Wu, J., Integrated performance evaluating criteria for network traffic control, in Proceedings of IEEE Symposium on Computers and Communications 2001, Tunisia: IEEE Communications Society Press, 2001, 391–396.
Cruz, R. L., A calculus for network delay, Part I: Network elements in isolation, IEEE Trans. on Information Theory, Jan. 1991, 37(1): 114–131.
Cruz, R. L., A calculus for network delay, Part II: Network analysis, IEEE Trans. on Information Theory, Jan. 1991, 37(1): 132–141.
Kurose, J., On computing per-session performance bounds in high-speed multi-hop computer networks, in Proc. of ACM Sigmetrics and Performance ’92, New York, New York: ACM Press, 1992, 128–134
Yaron, O., Sidi, M., Performance and stability of communication networks via robust exponential bounds, IEEE/ACM Trans. on Networking, June 1993, 1(3): 372–385.
Chang, C. S., Stability, queue length, and delay of deterministic and stochastic queueing networks, IEEE Trans. on Automatic Control, May 1994, 39(5): 913–931.
Hurley, P., Boudec, J. L., A proposal for an asymmetric best-effort service, in Proceedings of IWQOS’99, London, New York: IEEE Press, 1999, 129–132
Pitsillides, A., Stylianou, G., Bandwidth allocation for virtual paths (BAVP): Investigation of performance of classical constrained and genetic algorithm based optimisation techniques, in Proceedings of INFOCOM’2000, Tel Aviv, New York: IEEE Press, 2000. 1379–1387
Lin, C., Performance analysis of request dispatching and selecting in web server clusters, Chinese Journal of Computers (in Chinese), 2000, 23(5): 500–508.
Lin, C., Shan, Z., Yang, Y., Integrated schemes of request dispatching and selecting in web server clusters, in Proceedings of WCC2000, Beijing: Publishing House of Electronics Industry, August 2000, 922–930.
Lin, C., Sheng, L., An integrative scheme of differentiated services, in Proceedings of MASCOTS 2000, San Francisco CA, New York: IEEE Computer Society DL, 2000, 441–448.
Dovrolis, C., Stiliadis, D., Relative differentiated services in the internet: Issues and mechanisms, in Proceedings of ACM SIGMETRICS’99, Atlanta, New York: ACM Press, May 1999, 204–205.
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. on Networking, June 1993, 1(3): 344–357.
Cruz, R. L., Quality of service guarantees in virtual circuit switched networks, IEEE Journal on Selected Areas in Communications, Aug 1995, 13(6): 1048–1056.
Cruz, R. L., Service burstiness and dynamic burstiness measures: A framework, Journal of High Speed Networks, 1992, 1(2): 105–127.
Hung, A., Kesidis, G., Bankwidth scheduling for wide-area ATM networks using virtual finishing times, IEEE/ACM Transactions on Networking, Feb. 1996, 4(1): 49–54.
Stiliadis, D., Varma, A., Latency-rate servers: A general model for analysis of traffic scheduling algorithms, IEEE/ACM Transactions on Networking, 1998, 6(5): 611–624.
Le Boudec, J.-Y., Connectionless data service in an atm-based customer premises network, Computer Networks and ISDN Systems, 1994, 26(11): 1409–1424.
Agrawal, R., Rajan, R., Performance bonds for flow control protocols, IEEE/ACM Transactions on Networking, 1999, 7(3): 310–323.
Reich, E., On the integrodifferential equation of Takacs. I, Annals of Mathematical Statistics, 1958, 29: 563–570.
Roberts, J. W., Virtamo, J. T., The superposition of periodic cell arrival streams in an ATM multiplexer, IEEE Trans. on Communications, Feb. 1991, 39(2): 298–303.
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. on Networking, June 1993, 1(3): 344–357.
Saha, D., Mukherjee, S., Tripathi, S. K., Multirate scheduling of VBR video traffic in ATM networks, Ph.D. Dissertation, Dept. Elect. Comput. Eng., Univ. California at San Diego, 1996.
Ucb/lbnl/vint network simulator - ns (version 2).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jiang, Y., Wu, J. The proportional fairness scheduling algorithm on multi-classes. Sci China Ser F 46, 161–174 (2003). https://doi.org/10.1360/03yf9014
Received:
Issue Date:
DOI: https://doi.org/10.1360/03yf9014