An efficient scheme to achieve weighted max-min fairness on bandwidth allocation

In this paper, a scheme is proposed to achieve weighted max-min fairness on bandwidth allocation. The scheme supports various bandwidth requirements of users according to their weights. With the reservation strategy, the minimum bandwidth of each flow is guaranteed. The scheme achieves fair allocation rapidly when the network condition changes. The basic idea is to find the bandwidth share of each active flow at its bottleneck link and then assign this bottleneck share as its fair allocation. The correctness of the scheme is also proven. The scheme is efficient since it takes O(log N ) time to allocate bandwidth to N active flows. Simulations performed validate that the scheme reacts quickly to the changes of network condition and re-establishes the state of fair allocation fast.

[1]  Raj Jain,et al.  The ERICA switch algorithm for ABR traffic management in ATM networks , 1998, TNET.

[2]  Martin de Prycker,et al.  Asynchronous Transfer Mode, Solution for Broadband Isdn , 1991 .

[3]  Douglas S. Reeves,et al.  On-line dynamic bandwidth allocation , 1997, Proceedings 1997 International Conference on Network Protocols.

[4]  Shengming Jiang,et al.  A Fast Switch Algorithm for ABR Traffic to Achieve Max-Min Fairness , 1996, International Zurich Seminar on Digital Communications.

[5]  Raj Jain,et al.  General weighted fairness and its support in explicit rate switch algorithms , 2000, Comput. Commun..

[6]  Danny H. K. Tsang,et al.  A new rate-based switch algorithm for ABR traffic to achieve max-min fairness with analytical approximation and delay adjustment , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[7]  Mark Allen Weiss,et al.  Data structures and algorithm analysis in C , 1991 .

[8]  Xipeng Xiao,et al.  Internet QoS: a big picture , 1999, IEEE Netw..

[9]  D. Reininger,et al.  Paying for QoS: an optimal distributed algorithm for pricing network resources , 1998, 1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136).

[10]  Raj Jain,et al.  A Sample Switch Algorithm , 1995 .

[11]  A. Charny,et al.  An Algorithm for Rate Allocation in a Packet-Switching Network With Feedback , 1994 .

[12]  F. Bonomi,et al.  The rate-based flow control framework for the available bit rate ATM service , 1995, IEEE Netw..