Stochastic convex ordering for multiplicative decrease internet congestion control

Window growth function for congestion control is a strong determinant of protocol behaviors, especially its second and higher-order behaviors associated with the distribution of transmission rates, its variances, and protocol stability. This paper presents a new stochastic tool, called convex ordering, that provides an ordering of any convex function of transmission rates of two multiplicative-decrease protocols and valuable insights into high-order behaviors of protocols. As the ordering determined by this tool is consistent with any convex function of rates, it can be applied to any unknown metric for protocol performance that consists of some high-order moments of transmission rates, as well as those already known such as rate variance. Using the tool, it is analyzed that a protocol with a growth function that starts off with a concave function and then switches to a convex function (e.g., an odd order function such as x^3 and x^5) around the maximum window size in the previous loss epoch, gives the smallest rate variation under a variety of network conditions. Among existing protocols, BIC and CUBIC have this window growth function. Experimental and simulation results confirm the analytical findings.

[1]  Nick McKeown,et al.  Rate control protocol (rcp): congestion control to make flows complete quickly , 2008 .

[2]  Nick McKeown,et al.  RCP-AC: Congestion Control to Make Flows Complete Quickly in Any Environment , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[3]  Injong Rhee,et al.  CUBIC: a new TCP-friendly high-speed TCP variant , 2008, OPSR.

[4]  Mark A. McComb.  Comparison Methods for Stochastic Models and Risks , 2003, Technometrics.

[5]  Archan Misra,et al.  The window distribution of idealized TCP congestion avoidance with variable packet loss , 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).

[6]  D. Aldous,et al.  A survey of max-type recursive distributional equations , 2004, math/0401388.

[7]  Philippe Robert,et al.  AIMD algorithms and exponential functionals , 2004 .

[8]  Chadi Barakat,et al.  A stochastic model of TCP/IP with stationary random losses , 2000, TNET.

[9]  Mark Handley,et al.  Congestion control for high bandwidth-delay product networks , 2002, SIGCOMM.

[10]  Eitan Altman,et al.  c ○ 2005 Springer Science + Business Media, Inc. Manufactured in The Netherlands. Fairness in MIMD Congestion Control Algorithms , 2022 .

[11]  Mark Handley,et al.  Equation-based congestion control for unicast applications , 2000, SIGCOMM.

[12]  Eitan Altman,et al.  Performance analysis and stochastic stability of congestion control protocols , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[13]  Paul Barford,et al.  Generating representative Web workloads for network and server performance evaluation , 1998, SIGMETRICS '98/PERFORMANCE '98.

[14]  Vidyadhar G. Kulkarni,et al.  STOCHASTIC DIFFERENTIAL EQUATION FOR TCP WINDOW SIZE: ANALYSIS AND EXPERIMENTAL VALIDATION , 2004, Probability in the Engineering and Informational Sciences.

[15]  Jean-Chrysostome Bolot,et al.  Control mechanisms for packet audio in the Internet , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[16]  Dmitri Loguinov,et al.  Delayed stability and performance of distributed congestion control , 2004, SIGCOMM '04.

[17]  Ramesh Johari,et al.  End-to-end congestion control for the internet: delays and stability , 2001, TNET.

[18]  R. Srikant,et al.  Stability and convergence of TCP-like congestion controllers in a many-flows regime , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[19]  Deepak Bansal,et al.  Binomial congestion control algorithms , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[20]  Cheng Jin,et al.  FAST TCP: Motivation, Architecture, Algorithms, Performance , 2006, IEEE/ACM Transactions on Networking.

[21]  Lisong Xu,et al.  Media Streaming via TFRC: An Analytical Study of the Impact of TFRC on User-Perceived Media Quality , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[22]  F. Guillemin,et al.  A Markovian analysis of additive-increase multiplicative-decrease algorithms , 2002, Advances in Applied Probability.

[23]  Philippe Robert,et al.  Limit results for Markovian models of TCP , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[24]  Eitan Altman,et al.  State-dependent M/G/1 type queueing analysis for congestion control in data networks , 2002, Comput. Networks.

[25]  Injong Rhee,et al.  Binary increase congestion control (BIC) for fast long-distance networks , 2004, IEEE INFOCOM 2004.

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

[27]  Kevin Jeffay,et al.  Variability in TCP round-trip times , 2003, IMC '03.

[28]  Eitan Altman,et al.  State-dependent M/G/1 type queueing analysis for congestion control in data networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[29]  Matthew Mathis,et al.  The stationary behavior of ideal TCP congestion avoidance , 1996 .

[30]  Douglas J. Leith,et al.  H-TCP : TCP for high-speed and long-distance networks , 2004 .

[31]  Injong Rhee,et al.  Stochastic Ordering for Internet Congestion Control and its Applications , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[32]  Frank Kelly,et al.  Fairness and Stability of End-to-End Congestion Control , 2003, Eur. J. Control.

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

[34]  Jitendra Padhye,et al.  A Stochastic Model of TCP Reno Congestion Avoidence and Control , 1999 .

[35]  Geir E. Dullerud,et al.  Global stability of Internet congestion controllers with heterogeneous delays , 2006, IEEE/ACM Transactions on Networking.

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

[37]  Ren Wang,et al.  TCP westwood: Bandwidth estimation for enhanced transport over wireless links , 2001, MobiCom '01.

[38]  Yin Zhang,et al.  On the constancy of internet path properties , 2001, IMW '01.

[39]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

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