nPFS: Efficient Management of Multiple QoS Objects

Authors:
Yong Jiang;Jianping Wu
Affiliations:
-;-
Venue:
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Year:
2001

Citing 5
Cited 0

On computing per-session performance bounds in high-speed multi-hop computer networks

SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Performance and stability of communication networks via robust exponential bounds

IEEE/ACM Transactions on Networking (TON)
Relative differentiated services in the Internet: issues and mechanisms

SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Integrated Performance Evaluating Criteria for Network Traffic Control

ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current proposals for the packet scheduling strategy of multiple performance objects in high-speed packet-switched networks 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 networkperformance, 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.