A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer

We propose a scheme for congestion avoidance in networksusing a connectionless protocol at the network layer. The schemeuses feedback from the network to the users of the network. Theinteresting challenge for the scheme is to use a minimal amount offeedback (one bit in each packet) from the network to adjust theamount of traffic allowed into the network. The servers in thenetwork detect congestion and set a congestion indicationbit on packets flowing in the forward direction. The congestionindication is communicated back to the users through the transportlevel acknowledgement.The scheme is distributed, adapts to the dynamic state of thenetwork, converges to the optimal operating point, is quite simpleto implement, and has low overhead while operational. The schemealso addresses a very important aspect of fairness in theservice provided to the various sources utilizing the network. Thescheme attempts to maintain fairness in service provided tomultiple sources. This paper presents the scheme and the analysis that went intothe choice of the various decision mechanisms. We also address theperformance of the scheme under transient changes in the networkand for pathological conditions.