Weighted Fair Queuing (WFQ)
Algorithm (Demers and Keshav, 1989):
- For each packet, employ the GPS scheduler to compute the packet service finish-times.
F (i, k, t) = max {F (i, k-1, t), R (t)} + P (i, k, t)/W (i).
- Serve packets in order of their finish-times.
Advantages:
- Performs well with variable size packets, and does not need to know the average packet size in advance.
Disadvantages:
- Iterated deletion and implementation complexity.
- Scalability problem.