A simple abr switch algorithm for the weighted max-min fairness policy

An important concept in the A B R service model is the minimum cell rate ( M C R) guarantee as well as the peak cell rate (PCR) constraint for each A B R virtual connection. Due to the M C R and P C R requirements, the well-known max-min fairness policy is not suficient to determine the fair rate allocation in the ABR service model. W e present the weighted max-min ( W M M) fairness policy, which supports both the M C R and PCR requirements for each A B R virtual connection. A centralized algorithm is presented to compute network-wide bandwidth allocation to achieve this policy. Furthermore, a simple A B R algorithm based on the Intelligent Marking technique is developed with the aim of achieving the W M M fairness policy in the distributed ABR environment. The egectiveness of our A B R algorithm is demonstrated by simulation results based on the benchmark network configurations suggested by the A T M Forum