Time-averaging of high-speed data transfer protocols

We propose two modeling approaches of additive-increase/multiplicative-decrease (AIMD) congestion control mechanisms. The first separates the increase and decrease parts whereas the second describes the rate evolution of the congestion window as a continuous process governed by a differential equation. We relate these approaches and show that the second (fluid-flow) model results from deterministic time averaging of the first (discontinuous) model. A generalized class of nonlinear protocols, which includes Floyd's HighSpeed TCP, is then proposed and analyzed. Our findings are validated by simulation.

[1]  B. J. Prabhu,et al.  Fairness in MIMD Congestion Control Algorithms , 2005, Telecommun. Syst..

[2]  S. Floyd,et al.  Tcp-friendly unicast rate-based flow control , 1997 .

[3]  Mark Handley,et al.  A Comparison of Equation-Based and AIMD Congestion Control , 2000 .

[4]  Eitan Altman,et al.  A stochastic model of TCP/IP with stationary random losses , 2005, TNET.

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

[6]  F. Verhulst,et al.  Averaging Methods in Nonlinear Dynamical Systems , 1985 .

[7]  Sally Floyd,et al.  RFC 2018: TCP Selective Acknowledgment Options , 1996 .

[8]  Patrick Brown,et al.  Resource sharing of TCP connections with different round trip times , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[9]  Tom Kelly,et al.  Scalable TCP: improving performance in highspeed wide area networks , 2003, CCRV.

[10]  Chuang Lin,et al.  Generalized Modeling and Stability Analysis of HighSpeed TCP and Scalable TCP , 2006, IEICE Trans. Commun..

[11]  Eitan Altman,et al.  A stochastic Model of TCP/IP with Stationary Ergodic Random Losses , 1999 .

[12]  R. M. Bass,et al.  On the use of averaging for the analysis of power electronic systems , 1989, 20th Annual IEEE Power Electronics Specialists Conference.

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

[14]  Eduardo D. Sontag,et al.  Mathematical Control Theory: Deterministic Finite Dimensional Systems , 1990 .

[15]  François Baccelli,et al.  AIMD, fairness and fractal scaling of TCP traffic , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[16]  Sally Floyd,et al.  HighSpeed TCP for Large Congestion Windows , 2003, RFC.

[17]  Eitan Altman,et al.  Modeling TCP and High Speed TCP: A Nonlinear Extension to AIMD Mechanisms , 2004, HSNMC.

[18]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control , 2003 .

[19]  Frank Kelly,et al.  Mathematical modeling of the Internet , 1999 .

[20]  Vadim I. Utkin,et al.  Sliding Modes in Control and Optimization , 1992, Communications and Control Engineering Series.

[21]  R. Núñez Queija,et al.  TCP modeling in the presence of nonlinear window growth , 2001 .

[22]  M. Ritter,et al.  Network buffer requirements of the rate-based control mechanism for ABR services , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.