Abstract
The central issue of explicit rate control for Available Bit Rate (ABR) service in ATM networks is the computation of fair rate for every connection. In this paper, we propose a new fair-rate allocation algorithm called Fast Max-Min Rate Allocation (FMMRA) for ATM switches supporting ABR service. The FMMRA algorithm provides the means to compute the max-min fair rates with O(1) computational complexity. This exact calculation of fair rates expedites quick convergence to max-min fair shares, and offers excellent transient response. At the steady state, the algorithm operates without causing any oscillations in rates. The FMMRA algorithm does not require any parameter tuning and proves to be very robust in a large ATM network. Some simulation results are provided to show the effectiveness of the algorithm.
| Original language | English (US) |
|---|---|
| Pages | 200-204 |
| Number of pages | 5 |
| State | Published - 1997 |
| Externally published | Yes |
| Event | Proceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3) - Montreal, Can Duration: Jun 8 1997 → Jun 12 1997 |
Other
| Other | Proceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3) |
|---|---|
| City | Montreal, Can |
| Period | 6/8/97 → 6/12/97 |
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Electrical and Electronic Engineering