Fair Queueing

• Work conserving discipline in which each flow is entitled to receive at most the fair rate f associated to the link

  • a flow with arrival rate r receives min(r, f) bandwidth
  • f computed such that when link congested the aggregate arrival rate equals link’s capacity

• known algorithms require per flow state

  • e.g.: WFQ, DRR, SCFQ, WF2Q, SFQ

8

6

2

4

4

2

f = 4:

min(6, 4) = 4

min(8, 4) = 4

min(2, 4) = 2

10

Previous slide

Next slide

Back to first slide

View graphic version