Network congestion avoidance

From Wikipedia, the free encyclopedia

Network congestion avoidance is a process used in computer networks to avoid congestion. The fundamental problem is that all network resources are limited, including router processing time and link throughput. Users can easily overload certain networking resources (as in a denial of service attack), making the network unusable, unless steps are taken to prevent this. Implementations of connection-oriented protocols, such as the widely-used TCP protocol, generally watch for packet errors, losses, or delays (see Quality of Service) in order to adjust the transmit speed. There are many different network congestion avoidance processes, since there are a number of different trade-offs available.

Contents 1 TCP/IP congestion avoidance 2 Random early detection 3 Flowbased-RED/WRED 4 IP ECN 5 Cisco AQM: Dynamic buffer limiting (DBL) 6 Good things about active queue management (RED, WRED, ECN, Cisco DBL) 7 See also 8 References 9 External links

[edit] TCP/IP congestion avoidance

The TCP congestion avoidance algorithm is the primary basis for congestion control in the Internet.

Problems occur when many concurrent TCP flows are experiencing port queue buffer tail-drops. Then TCP's automatic congestion avoidance is not enough. All flows that experience port queue buffer tail-drop will begin a TCP retrain at the same moment - this is called TCP global synchronization.

[edit] Random early detection

One solution is to use random early detection (RED) on network equipments port queue buffer. On network equipment ports with more than one queue buffer, weighted random early detection (WRED) could be used if available. RED indirectly signals to sender and receiver by deleting some packets, eg. when the average queue buffer lengths are more than 50% filled and deletes exponentially more packets^{[citation needed]}, when the average queue buffer lengths are approaching 100%. The average queue buffer lengths are computed over 1 second at a time.

[edit] Flowbased-RED/WRED

Some network equipment are equipped with ports that can follow and measure each flow (flowbased-RED/WRED) and are hereby able to signal to a too big bandwidth flow according to some QoS policy. A policy could divide the bandwidth among all flows by some criteria.

[edit] IP ECN

Another approach is to use IP ECN. ECN is only used when the two hosts signal that they want to use it. With this method, an ECN bit is used to signal that there is explicit congestion. This is better in some ways than the indirect packet delete congestion notification performed by the RED/WRED algorithms, but it requires explicit support by both hosts to be effective. Some outdated or buggy network equipment drops packets with the ECN bit set, rather than ignoring the bit. More information on the status of ECN including the version required for Cisco IOS can be found at http://www.icir.org/floyd/ecn.html - which is by Sally Floyd, one of the authors of ECN.

When a router receives a packet marked as ECN capable and anticipates (using RED) congestion, it will set a flag notifying the sender to decrease its window size (sending rate). The intent is to avoid resending packets.

[edit] Cisco AQM: Dynamic buffer limiting (DBL)

Cisco has taken a step further in their Catalyst 4000 series with engine IV. Engine IV has the possibility to classify all connection-oriented flows in "aggressive" (bad) and "adaptive" (good). It ensures that no flows fill the port queues for a long time. DBL can utilize IP ECN instead of packet-delete-signalling. See the sections in: Active Queue Management and Enabling Dynamic Buffer Limiting.

[edit] Good things about active queue management (RED, WRED, ECN, Cisco DBL)

"Recommendations on Queue Management and Congestion Avoidance in the Internet" (RFC 2309) states that:

• Less packets will be dropped with Active Queue Management (AQM).
• The link utilization will increase because less TCP global synchronization will occur.
• By keeping the average queue size small, queue management will reduce the delays and jitter seen by flows.
• The connection bandwidth will be more equally shared among connection oriented flows, even without flow-based RED or WRED.

[edit] See also

• Traffic shaping
• Quality of service
• Exponential backoff
• max-min fairness

[edit] References

• Van Jacobson, Michael J. Karels. Congestion Avoidance and Control (1988). Proceedings of the Sigcomm '88 Symposium, vol.18(4): pp.314–329. Stanford, CA. August, 1988. This paper originated many of the congestion avoidance algorithms used in TCP/IP.

• Sally Floyd, Van Jacobson. Random Early Detection Gateways for Congestion Avoidance (1993). IEEE/ACM Transactions on Networking, vol.1(4): pp.397–413. Invented Random Early Detection (RED) gateways.

[edit] External links

• Sally Floyd: RED (Random Early Detection) Queue Management
• April 1998, RFC2309: Recommendations on Queue Management and Congestion Avoidance in the Internet, Original RFC2309
• RFC2001: TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms, Original RFC2001
• TCP Congestion Control, Original RFC2581
• TCP Increasing TCP's Initial Window, Original RFC3390
• The Addition of Explicit Congestion Notification (ECN) to IP, Original RFC3168
• Linktionary term: Queuing
• Comparative study of RED, ECN and TCP Rate Control (1999)
• Pierre-Francois Quet, Sriram Chellappan, Arjan Durresi, Mukundan Sridharan, Hitay Ozbay, Raj Jain, " Guidelines for optimizing Multi-Level ECN, using fluid flow based TCP model"
• Sally Floyd, Ratul Mahajan, David Wetherall: RED-PD: RED with Preferential Dropping
• TCP Tunnels: Avoiding Congestion Collapse (2000)
• TCP Congestion Avoidance Explained via a Sequence Diagram
• A Generic Simple RED Simulator for educational purposes by Mehmet Suzen