Router Mechanisms to Support End-to-End Congestion Control

This paper considers the potential negative impacts from an increasing deployment of non-congestion-controlled besteffort traffic on the Internet. These negative impacts range from extreme unfairness against competing TCP traffic to the potential for congestion collapse. To promote the inclusion of end-to-end congestion control for best-effort traffic, we propose lightweight router mechanisms for identifying and restricting the bandwidth of high-bandwidth best-effort flows that are using a disproportionate share of the bandwidth in times of congestion. Our method does not require per-flow state based on packet arrivals, but instead relies on the history of packet drops from a queue with RED (Random Early Detection) queue management. Starting with high-bandwidth flows identified from the RED drop history, we describe a sequence of tests capable of suggesting flows for bandwidth regulation. These tests additionally identify a high-bandwidth flow in times of congestion as unresponsive, “not TCP-friendly”, or simply veryhigh-bandwidth. An unresponsive flow is one failing to reduce its offered load at a router in response to an increased packet drop rate. A flow that is not TCP-friendly is one whose long-term arrival rate exceeds that of any conformant TCP in the same circumstances. A very-high-bandwidth flow uses a disproportionate share of the bandwidth relative to other flows. Simulations show the results of regulating the bandwidth of these unresponsive, TCP-unfriendly, or veryhigh-bandwidth flows in times of congestion. We end with a comparison between this approach and others using per-flow scheduling for all best-effort traffic.

[1]  Jeffrey C. Mogul,et al.  Fragmentation considered harmful , 1987, SIGCOMM '87.

[2]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

[3]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[4]  Scott Shenker,et al.  Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines , 1994, SIGCOMM.

[5]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[6]  Keith McCloghrie,et al.  IP MTU discovery options , 1988, RFC.

[7]  Van Jacobson,et al.  Traffic phase effects in packet-switched gateways , 1991, CCRV.

[8]  Sally Floyd,et al.  Dynamics of TCP Traffic over ATM Networks , 1995, IEEE J. Sel. Areas Commun..

[9]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

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

[11]  Kevin R. Fall Comparisons of Tahoe, Reno, and Sack TCP , 1995 .

[12]  B. Barden Recommendations on queue management and congestion avoidance in the Internet , 1998 .

[13]  John Nagle,et al.  Congestion control in IP/TCP internetworks , 1995, CCRV.

[14]  David Clark,et al.  Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism , 1992, SIGCOMM.

[15]  Sally Floyd,et al.  Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic , 1991, CCRV.