DocumentCode :
2819342
Title :
A new priority calculation method for sorted-priority fair queuing
Author :
Liu, Fei ; Huang, Yi ; Ma, Yi ; Yi, Na
Author_Institution :
Dept. of Electr. Eng. & Electron., Liverpool Univ., UK
fYear :
2004
fDate :
5-8 Jan. 2004
Firstpage :
110
Lastpage :
115
Abstract :
The packet priority calculation method, also referred to as packet selection policy, is a necessary component for sorted priority based packet schedulers. A new packet priority calculation method, called smallest middle-point finish time first (SMFF), is proposed. An analysis model, called packet rate proportional server plus (PRPS+), based on the packet rate proportional server (PRPS) is developed to act as the start point for the discussion on the SMFF. It is shown that the packet schedulers based on sorted-priority can be modeled by the PRPS+ class, (such as weighted fair queuing, start-time fair queuing, self clocked fair queuing and worst-case fair weighted fair queuing); it is demonstrated that the scheduling fairness is improved if their priority calculation methods are replaced by SMFF.
Keywords :
packet switching; quality of service; queueing theory; scheduling; QoS; packet priority calculation method; packet rate proportional server plus; packet schedulers; packet selection policy; quality of service; self clocked fair queuing; smallest middle-point finish time first; sorted-priority fair queuing; start-time fair queuing; worst-case fair weighted fair queuing; Clocks; Home automation; IP networks; Packet switching; Quality of service; Scheduling algorithm; Sorting; Traffic control; Videoconference; Web and internet services;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Consumer Communications and Networking Conference, 2004. CCNC 2004. First IEEE
Conference_Location :
Las Vegas, NV, USA
Print_ISBN :
0-7803-8145-9
Type :
conf
DOI :
10.1109/CCNC.2004.1286842
Filename :
1286842
Link To Document :
بازگشت