New Weighted Fair Queue Scheduling Algorithm
Xie Jian-ying · Jisuanji gongcheng · 2008
Traditional weighted fair queue algorithms have the main drawback: the calculation of the weight parameters according to each packet.The paper proposes a new weighted fair queueing algorithm(SPFQ),which uses service probability to schedule packets and a random number to decide which packet to be served next.In addition,a novel adaptive service probability parameter calculation method is used to solve the unfair problem induced by the variable packet length and an adaptive queue management technology to improve the utilization of the server's queue buffer and reduce the delay burstiness.Simulation results demonstrate the validity and practicability of SPFQ.