A new rate-based switch algorithm for ABR traffic to achieve max-min fairness with analytical approximation and delay adjustment

A new rate-based switch mechanism for ABR traffic in ATM networks, which aims to rapidly achieve max-min fairness allocation, is proposed. Simulation results show that the proposed scheme can out-perform both CAPC and ERICA in terms of response times and peak queue lengths. An analytical approximation of the performance is also introduced and its accuracy is found to be close to the simulation results. A variant of the proposed scheme is presented for handling the problem of different source-to-bottleneck separations. By using this scheme, the peak queue lengths at the switches can further be reduced without any degradation in throughput.