Abstract
As the speed and the dynamic range of computer networks evolve, the issue of efficient traffic management becomes increasingly important. This work describes an approach to traffic management using explicit rate information provided to the source by the network. We present an asynchronous distributed algorithm for optimal rate calculation across the network, where optimality is understood in the maxmin sense. The algorithm quickly converges to the optimal rates and is shown to be well-behaved in transience.
| Original language | English |
|---|---|
| Pages | 1954-1963 |
| Number of pages | 10 |
| State | Published - 1995 |
| Event | Proceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3) - Seattle, WA, USA Duration: Jun 18 1995 → Jun 22 1995 |
Conference
| Conference | Proceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3) |
|---|---|
| City | Seattle, WA, USA |
| Period | 06/18/95 → 06/22/95 |