Random drop congestion control
- 1 August 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 20 (4), 1-7
- https://doi.org/10.1145/99508.99521
Abstract
Gateways in very high speed internets will need to have low processing requirements and rapid responses to congestion. This has prompted a study of the performance of the Random Drop algorithm for congestion recovery. It was measured in experiments involving local and long distance traffic using multiple gateways. For the most part, Random Drop did not improve the congestion recovery behavior of the gateways A surprising result was that its performance was worse in a topology with a single gateway bottleneck than in those with multiple bottlenecks. The experiments also showed that local traffic is affected by events at distant gateways.Keywords
This publication has 4 references indexed in Scilit:
- The next generation of internetworkingACM SIGCOMM Computer Communication Review, 1989
- A connectionless congestion control algorithmACM SIGCOMM Computer Communication Review, 1989
- Analysis and simulation of a fair queueing algorithmACM SIGCOMM Computer Communication Review, 1989
- Congestion avoidance and controlACM SIGCOMM Computer Communication Review, 1988