Hierarchical packet fair queueing algorithms

Jon C. R. Bennett, Hui Zhang
1996 Computer communication review  
Hierarchical Packet Fair Queueing (H-PFQ) algorithms have the potential to simultaneously support guaranteed realtime service, rate-adaptive best-eort, and controlled linksharing service. In this paper, we design practical H-PFQ algorithms by using one-level Packet Fair Queueing (PFQ) servers as basic building blocks, and develop techniques to analyze delay and fairness properties of the resulted H-PFQ servers. We demonstrate that, in order to provide tight delay bounds in a H-PFQ server, it is
more » ... H-PFQ server, it is essential for the onelevel PFQ servers to have small Worst-case Fair Indices (WFI). We propose a new one-level PFQ algorithm called WF 2 Q+ that is the rst to have all the following three properties: (a) providing the tightest delay bound among all PFQ algorithms; (b) having the smallest WFI among all PFQ algorithms; and (c) having a relatively low implementation complexity of O(log N). We show that practical H-PFQ algorithms can be implemented by using WF 2 Q+ as the basic building block and prove that the resulting H-WF 2 Q+ algorithms provide similar delay bounds and bandwidth distribution as those provided by a H-GPS server. Simulation experiments are presented to evaluate the proposed algorithm.
doi:10.1145/248157.248170 fatcat:rstpkbpkd5gf5p4psqd42xq7ie