FPFQ: A Low Complexity Fair Queueing Algorithm for Broadband Networks

Abstract

A traffic scheduling algorithm based on the RPS model called FPFQ is proposed. In FPFQ, the result of finishing potentials sorting algorithm is used for recalibration of the system potential function. This reduces the system potential function complexity to O(l) while its fairness index is still comparable to that of SFPQ and WFQ. Analytical methods are invoked to show the effectiveness of FPFQ in terms of Delay bound and fairness index.