Proportional differentiated services for end-to-end traffic control

Authors:
Yong Jiang;Jianping Wu
Affiliations:
Graduate School at Shenzhen, Tsinghua University, Shenzhen, P.R. China;Graduate School at Shenzhen, Tsinghua University, Shenzhen, P.R. China
Venue:
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Year:
2005

Citing 4
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

Quantified Score

Hi-index	0.00

Visualization

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.