DocumentCode :
1597365
Title :
A novel hierarchical packet fair scheduling model
Author :
Yanlei, Shang ; Lifen, Zhao ; Ju, Liu ; Nájar, Montse
Author_Institution :
Sch. of Inf. Sci. & Eng., Shandong Univ., Jinan, China
Volume :
1
fYear :
2003
Firstpage :
239
Abstract :
In this paper, a novel hierarchical packet fair scheduling model is proposed based on the J. Bennett and H. Zhang scheduling model. The soft-QoS traffic introduced in this new model together with hard-QoS and best-effort traffic is scheduled by the router. The model can distribute bandwidth reasonably between the QoS and the best-effort traffic. It also guarantees the validity and fairness among the QoS traffic. The performance of the new model is proven by computer simulations.
Keywords :
IP networks; multimedia communication; packet switching; quality of service; scheduling; telecommunication traffic; IP network; best-effort traffic; hard-QoS traffic; hierarchical packet fair scheduling model; multimedia communication; soft-QoS traffic; Bandwidth; Bit rate; Communication system traffic control; Computer simulation; Information science; Microwave integrated circuits; Processor scheduling; Scheduling algorithm; Telecommunication traffic; Traffic control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication Technology Proceedings, 2003. ICCT 2003. International Conference on
Print_ISBN :
7-5635-0686-1
Type :
conf
DOI :
10.1109/ICCT.2003.1209076
Filename :
1209076
Link To Document :
بازگشت