Congestion Avoidance and Control：（拥塞避免和控制）.pdfVIP

Congestion Avoidance and Control Van Jacobson
Lawrence Berkeley Laboratory Michael J. Karels  University of California at Berkeley November, 1988 Introduction Since that time, we have put seven new algorithms into the 4BSD TCP : Computer networks have experienced an explosive growth (i) round-trip-time variance estimation over the past few years and with that growth have come severe congestion problems. For example, it is now common to see (ii) exponential retransmit timer backoff internet gateways drop 10% of the incoming packets because (iii) slow-start of local buffer overflows. Our investigation of some of these problems has shown that much of the cause lies in transport (iv) more aggressive receiver ack policy protocol implementations (not in the protocols themselves): The ‘obvious’ ways to implement a window-based transport (v) dynamic window sizing on congestion protocol can result in exactly the wrong behavior in response (vi) Karn’s clamped retransmit backoff to network congestion. We give examples of ‘wrong’ behav- ior and describe some simple algorithms that can be used to (vii) fast retransmit make right things happen. The algorithms are rooted in the