Abstract
Due to multiple performance objectives of network traffic control, corresponding packet scheduling strategy in next generation broadband service convergence network attract more and more attention. At the same time, the end-to-end Quality of Service (QoS) requirements need to be satisfied and the network resource should be allocated fair and efficiently. In this paper, we provides nPFS, a network proportional fairness scheduling strategy in packet-switched networks from proportional fairness principle [1], and the nPFS integrates several objects, such as the network performance, user’s QoS requirement and system fairness. Then it is analyzed and proved in detail. Moreover, the nPFS can be applied to design and improve the scheduling strategy and algorithms in packet-switched networks.
This research was sponsored by CNSF (No. 90104002) and GDNSF (No. 034308), and Development Plan of the State Key Fundamental Research (973) (No. 2003CB314805).
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
Lin, C., Jiang, Y., Zhou, W.: Integrated performance evaluating criteria for network traffic control. IEICE Trans. Commun. E85-B(11), 2447–2456 (2002)
Cruz, R.L.: A calculus for network delay, Part I: Network Elements in Isolation. IEEE Trans. on Information Theory 37(1), 114–131 (1991)
Cruz, R.L.: A calculus for network delay, Part II: Network Analysis. IEEE Trans. on Information Theory 37(1), 132–141 (1991)
Kurose, J.: On computing per-session performance bounds in high-speed multi-hop computer networks. In: Proc. of ACM Sigmetrics and Performance 1992, New York, pp. 128–134 (1992)
Yaron, O., Sidi, M.: Performance and stability of communication networks via robust exponential bounds. IEEE/ACM Trans. on Networking 1(3), 372–385 (1993)
Chang, C.S.: Stability, queue length, and delay of deterministic and stochastic queueing networks. IEEE Trans. on Automatic Control 39(5), 913–931 (1994)
Hurley, P., Boudec, J.L.: A Proposal for an Asymmetric Best-Effort Service. In: Proceedings of IWQOS 1999, London, pp. 129–132 (1999)
Pitsillides, A., Stylianou, G., et al.: 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, pp. 1379–1387 (2000)
Dovrolis, C., Stiliadis, D.: Relative Differentiated Services in the Internet: Issues and Mechanisms. In: Proceedings of ACM SIGMETRICS 1999, Atlata, May 1999, pp. 204–205 (1999)
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 1(3), 344–357 (1993)
Jiang, Y., Wu, J.: The proportional fairness scheduling algorithm on multi-classes. Science in China Series F 46(3), 161–174 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, Y., Wu, J. (2005). Proportional Differentiated Services for End-to-End Traffic Control. In: Lu, X., Zhao, W. (eds) Networking and Mobile Computing. ICCNMC 2005. Lecture Notes in Computer Science, vol 3619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534310_71
Download citation
DOI: https://doi.org/10.1007/11534310_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28102-3
Online ISBN: 978-3-540-31868-2
eBook Packages: Computer ScienceComputer Science (R0)