Two simple implementation algorithms of WFQ and their performance analysis
Xiaohui Jin, Jiandong Li, Guo Feng · 2002
Combining with OTPQ (one timestamp per queue), time-based WFQ (weighted fair queuing) and bit-based WFQ are proposed. The virtual time of time-based WFQ is obtained from the system clock and that of bit-based WFQ from the virtual bits that the system has sent. After a theoretical analysis, the simulation proves that time-based WFQ has the same performance as the original WFQ, but its implementation is simpler than WFQ. Bit-based WFQ is simpler than time-based WFQ, but is not very exact.