Effectiveness of congestion avoidance: a measurement study

The authors describe the implementation of the binary feedback congestion avoidance (CA) policies and report measurements of the CA scheme in an OSI testbed at MITRE. The goal is to experiment with network configurations and traffic loads varied and complex enough to allow realistic performance evaluation of CA. These measurement experiments present evidence that the congestion avoidance policy operates effectively with a variety of traffic loads and configurations. The conditions used for the measurement experiments with CA include the coexistence of traffic participating in the CA scheme with intermittent traffic that does not participate in CA; and use of CA with realistic traffic such as bulk data file transfer type traffic and remote login traffic. These results show that there is a dramatic reduction in the mean and standard deviation of the response time as well as the number of retransmissions for all classes of traffic, even when some of the sources of traffic do not participate in the CA policy. The behavior of the CA policies with bidirectional traffic was also studied.<<ETX>>

[1]  Scott Shenker,et al.  Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic , 1991, SIGCOMM 1991.

[2]  A. Udaya Shankar,et al.  Dynamical behavior of rate-based flow control mechanisms , 1990, CCRV.

[3]  Scott Shenker,et al.  A Theoretical Analysis of Feedback Flow Control , 1990, SIGCOMM.

[4]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[5]  K. K. Ramakrishnan,et al.  Dynamics of congestion control and avoidance of two-way traffic in an OSI testbed , 1991, CCRV.

[6]  Scott Shenker,et al.  Some observations on the dynamics of a congestion control algorithm , 1990, CCRV.

[7]  Jon Crowcroft,et al.  A new congestion control scheme , 1991 .

[8]  John B. Nagle,et al.  On Packet Switches with Infinite Storage , 1987, IEEE Trans. Commun..

[9]  Scott Shenker,et al.  A theoretical analysis of feedback flow control , 1990, SIGCOMM '90.

[10]  Raj Jain,et al.  A Timeout-Based Congestion Control Scheme for Window Flow-Controlled Networks , 1986, IEEE J. Sel. Areas Commun..

[11]  Steven A. Heimlich Traffic characterization of the NSFNET national backbone , 1990, SIGMETRICS '90.

[12]  A. Mankin Random drop congestion control , 1990, SIGCOMM 1990.

[13]  Jon Postel,et al.  DOD standard transmission control protocol , 1980, CCRV.

[14]  Tim Boland Stable implementation agreements for open systems interconnection protocols Version 2 Edition 1, December 1988 , 1989 .

[15]  D. Grillo,et al.  Flow Control in Local-Area Networks of Interconnected Token Rings , 1985 .

[16]  D. Mitra,et al.  Dynamic adaptive windows for high speed data networks: theory and simulations , 1990, SIGCOMM 1990.

[17]  David Clark,et al.  An analysis of TCP processing overhead , 1989 .

[18]  Lixia Zhang,et al.  Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks , 1990, SIGCOMM.