DocumentCode
1831179
Title
nPFS: efficient management of multiple QoS objects
Author
Jiang, Yong ; Wu, Jianping
Author_Institution
Dept. of Comput. Sci., Tsinghua Univ, China
fYear
2001
fDate
2001
Firstpage
49
Lastpage
54
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, 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
Keywords
computer network reliability; packet switching; performance evaluation; quality of service; end-to-end Quality of Service; high-speed packet switched networks; multiple QoS objects management; multiple performance objects; nPFS; network performance; network proportional fairness scheduling strategy; network resource; packet scheduling strategy; system fairness; Computer science; Delay; Jitter; Proposals; Quality of service; Resource management; Scheduling algorithm; Telecommunication traffic; Throughput; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Networks and Mobile Computing, 2001. Proceedings. 2001 International Conference on
Conference_Location
Los Alamitos, CA
Print_ISBN
0-7695-1381-6
Type
conf
DOI
10.1109/ICCNMC.2001.962573
Filename
962573
Link To Document