In this contribution we have presented four algorithms which achieve generalized fairness and provide MCR guarantee. The algorithms monitor the load on the link and calculate the overload factor. The overload is used with
ExcessFairShareor
WtMaxAllocPreviousto calculate the feedback. The algorithm D, which uses the VCShareand
WtMaxAllocPreviousis the best, since it has O(1) complexity and does not require per VC accounting to handle source bottlenecks.

Figure 4:
Three Sources: ACR graphs for algorithms A, B, C and D.

[Algorithm A]
[Algorithm B]

[Algorithm C]
[Algorithm D]

Figure 5:
Three Sources transient: ACR graphs for algorithms A, B, C and D.

[Algorithm A]
[Algorithm B]

[Algorithm C]
[Algorithm D]

Figure 6:
Source Bottleneck: ACR graphs for Algorithm A, B, C and D

[Algorithm A]
[Algorithm B]

[Algorithm C]
[Algorithm D]

Figure 7:
Source Bottleneck: ACR graphs for Algorithm A, B using measured source rate

[Algorithm A]
[Algorithm B]

Figure 8:
GFC-2 configuration: ACR graphs for algorithms A, B, C and D.