Dynamics of congestion control and avoidance of two-way traffic in an OSI testbed
- 1 April 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 21 (2) , 43-58
- https://doi.org/10.1145/122419.122422
Abstract
An extensive set of measurements were made in an OSI testbed to study the behavior of congestion control and avoidance. Testbed systems used the Connectionless Network Protocol (CLNP) and Transport Protocol Class 4 (TP4), which had been modified to perform the CE-bit [10] congestion avoidance and the "CUTE" [6] congestion recovery algorithms.We found that two-way traffic has dynamics which can significantly decrease fairness among competing connections using congestion avoidance. We present experiments that demonstrate this problem and our analysis of how two-way traffic results in reduced fairness. This analysis led us to develop an effective modification to the congestion avoidance algorithms to maintain fairness with two-way traffic.Our analysis of experimental results also points to undesirable interactions between two-way traffic dynamics and a sending strategy that times data transmissions, by the receipt of acknowledgements. These interactions reinforce burstiness of transmissions. therefore increasing buffering requirements and delay in routers. They may also decrease throughput.Keywords
This publication has 10 references indexed in Scilit:
- A new congestion control schemeACM SIGCOMM Computer Communication Review, 1991
- Some observations on the dynamics of a congestion control algorithmACM SIGCOMM Computer Communication Review, 1990
- Virtual clock: a new traffic control algorithm for packet switching networksACM SIGCOMM Computer Communication Review, 1990
- Random drop congestion controlACM SIGCOMM Computer Communication Review, 1990
- A theoretical analysis of feedback flow controlACM SIGCOMM Computer Communication Review, 1990
- Dynamic adaptive windows for high speed data networks: theory and simulationsACM SIGCOMM Computer Communication Review, 1990
- Dynamical behavior of rate-based flow control mechanismsACM SIGCOMM Computer Communication Review, 1990
- Congestion avoidance and controlACM SIGCOMM Computer Communication Review, 1988
- A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layerACM SIGCOMM Computer Communication Review, 1988
- A Timeout-Based Congestion Control Scheme for Window Flow-Controlled NetworksIEEE Journal on Selected Areas in Communications, 1986