A New Fair Queueing Algorithm with Dynamic Service Probability Adjustment
De-Bin Yin, Jichao Xie, Xing Ping Fan · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2007
This letter proposes a new weighted fair queueing algorithm, which adjusts dynamically each flow's service probability according to its weight and average packet length and then uses the service probability parameters to implement fair queueing. This solves the main drawback of traditional weighted fair queueing algorithms — the packet-based tracing of weight parameters. In addition, this letter proposes a novel service probability calculation method which solves the unfairness problem induced by the variable packet length.