A Service Ratio-Based Dynamic Fair Queueing Algorithm for Packet-Switching Networks

A new weighted fair queueing algorithm is proposed, which uses the novel flow-based service ratio parameters to schedule flows. This solves the main drawback of traditional weighted fair queueing algorithms-the packet-based calculation of the weight parameters. In addition, this paper proposes a novel service ratio calculation method and a queue management technology. The former adjusts the service ratio parameters adaptively based on the dynamics of the packet lengths and then solves the unfairness problem induced by the variable packet length. The latter improves the utilization of the server’s queue buffer and reduces the delay jitter through restricting the buffer length for each flow.

A new weighted fair queueing algorithm is proposed, which uses the novel flow-based service ratio parameters to schedule flows. This solves the main drawback of traditional weighted fair queneing algorithms- the packet-based calculation of the weight parameters. In addition, this paper proposes a novel service ratio calculation method and a queue mangement technology. The former adjusts the service ratio parameters adaptively based on the dynamics of the packet lengths and thee solves the unfairness problem induced by the variable packet length. The latter improves the utilization of the server＇s queue buffer and reduces the delay jitter through restricting the buffer length for each flow.