A Scheme to Achieve Weighted Max-Min Fairness Allocation for High Speed Networks

Abstract

In this paper, a scheme is proposed to achieve the weighted max-min fairness on bandwidth allocation in networks. Since allocation is done according to the weights of weights of all the user flows, the scheme supports various bandwidth requirements of users. The scheme can achieve the fairness allocation rapidly once the network condition change. Before the fairness allocation is achieved, the switches an active flow passes through may allocate individual bandwidth shares to the flow. With the proposed scheme, for this active flow the smallest share can be quickly found and is allocated. For each active flow if its bandwidth shares at different switches converge to the smallest share, the weighted max-min fairness is achieved. The correctness has been proved in this paper. On the other hand, the scheme is efficient since each switch takes O(log N) to allocate bandwidth to N active flows.