Stochastic Ordering for Internet Congestion Control

This paper presents a new stochastic tool, called convex ordering, that provides an ordering of any convex function of transmission rates of two 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 and x) 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]  Sally Floyd,et al.  HighSpeed TCP for Large Congestion Windows , 2003, RFC.

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

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

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

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

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

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

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

[9]  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).

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

[11]  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).

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

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

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

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

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

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

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

[19]  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..

[20]  Eitan Altman,et al.  A stochastic model of TCP/IP with stationary random losses , 2000, SIGCOMM.

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

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