 A data rate allocation is max-min fair if and only if a data flow between any two nodes has at least one bottleneck link.If resources are allocated in advance in the network nodes, max-min fairness can be obtained by using an algorithm of progressive filling.You start with all rates equal to 0 and grow all rates together at the same pace, until one or several link capacity limits are hit.