Scalable TCP congestion control

The packet losses imposed by IP networks can cause long and erratic recovery delays, since senders must often use conservative loss detection and retransmission mechanisms. This paper proposes a model to explain and predict loss rates for TCP traffic. Based on that model, the paper describes a new router buffering algorithm, flow-proportional queuing (FPQ), that handles heavy TCP loads without imposing high loss rates. FPQ controls TCP by varying the router's queue length in proportion to the number of active TCP connections. Simulation results show that FPQ produces the same average transfer delays as existing schemes, but makes the delays more predictable and fairer.

[1]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[2]  NagleJohn.  Congestion control in IP/TCP internetworks , 1984 .

[3]  Matthew Mathis,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997, CCRV.

[4]  H. T. Kung,et al.  TCP fast recovery strategies: analysis and improvements , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[5]  Eman Salaheddin Hashem,et al.  Analysis of Random Drop for Gateway Congestion Control , 1989 .

[6]  Henry J. Fowler,et al.  Local Area Network Traffic Characteristics, with Implications for Broadband Network Congestion Management , 1991, IEEE J. Sel. Areas Commun..

[7]  Vern Paxson,et al.  End-to-end Internet packet dynamics , 1997, SIGCOMM '97.

[8]  Stefan Savage,et al.  Modeling the Performance of Short TCP Connections , 1998 .

[9]  Don Towsley,et al.  Packet loss correlation in the MBone multicast network , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

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

[11]  George C. Polyzos,et al.  A Parameterizable Methodology for Internet Traac Ow Prooling , 1995 .

[12]  H. T. Kung,et al.  Credit-based flow control for ATM networks: credit update protocol, adaptive credit allocation and statistical multiplexing , 1994, SIGCOMM '94.

[13]  R. Wilder,et al.  Wide-area Internet traffic patterns and characteristics , 1997, IEEE Netw..

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

[15]  Cheng Song,et al.  High performance TCP in ANSNET , 1994, CCRV.

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

[17]  Craig Partridge,et al.  Improving round-trip time estimates in reliable transport protocols , 1991, TOCS.

[18]  Steven McCanne,et al.  The BSD Packet Filter: A New Architecture for User-level Packet Capture , 1993, USENIX Winter.

[19]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[20]  Van Jacobson.  Notes on using RED for Queue Management and Congestion Avoidance , 1998 .

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

[22]  Deborah Estrin,et al.  Recommendations on Queue Management and Congestion Avoidance in the Internet , 1998, RFC.

[23]  Peter B. Danzig,et al.  Characteristics of wide-area TCP/IP conversations , 1991, SIGCOMM '91.

[24]  Charles A. Eldridge,et al.  Rate controls in standard transport layer protocols , 1992, CCRV.

[25]  Robert Tappan Morris,et al.  Dynamics of random early detection , 1997, SIGCOMM '97.

[26]  Allison Mankin,et al.  Random drop congestion control , 1990, SIGCOMM '90.

[27]  M. Handley.  An Examination of MBone Performance , 1997 .

[28]  W. Richard Stevens,et al.  TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms , 1997, RFC.

[29]  Jean-Chrysostome Bolot,et al.  Characterizing End-to-End Packet Delay and Loss in the Internet , 1993, J. High Speed Networks.

[30]  Hsiang-Tsung Kung,et al.  Applications of randomness in system performance measurement , 1998 .

[31]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[32]  Walter Willinger,et al.  Experimental queueing analysis with long-range dependent packet traffic , 1996, TNET.

[33]  Van Jacobson,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[34]  H. T. Kung,et al.  Receiver-oriented adaptive buffer allocation in credit-based flow control for ATM networks , 1995, Proceedings of INFOCOM'95.

[35]  W. Richard Stevens,et al.  TCP/IP Illustrated, Volume 1: The Protocols , 1994 .

[36]  T. V. Lakshman,et al.  The drop from front strategy in TCP and in TCP over ATM , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[37]  T. V. Lakshman,et al.  SRED: stabilized RED , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

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

[40]  Greg Minshall,et al.  Flow labelled IP: a connectionless approach to ATM , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[41]  Vern Paxson,et al.  Automated packet trace analysis of TCP implementations , 1997, SIGCOMM '97.

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

[43]  Kang G. Shin,et al.  Techniques for Eliminating Packet Loss in Congested TCP/IP Networks , 1997 .