A fast-converging TCP-equivalent window-averaging rate control scheme

Smooth rate control schemes are necessary for Internet streaming flows to use available bandwidth. To equally share the Internet bandwidth with existing Transmission Control Protocol (TCP) flows, these new schemes should meet TCP-equivalent criterion, i.e., achieve the same transmission rates as TCP under the same network conditions. However, when the available bandwidth oscillates, many of these schemes fail to meet this criterion due to their slow increasing rate. This study proposes a window-averaging rate control (WARC) scheme to send packets at the same average rate as a TCP flow over a fixed time interval. Considering the TCP rate only over a fixed interval allows WARC to forget the historical loss condition more rapidly than other schemes, thus achieving a faster increasing rate when additional bandwidth becomes available. When the available bandwidth drops dramatically, WARC uses a history-reset procedure to converge its rate to the new steady rate immediately after a specified number of losses. The simulations in this study show that WARC not only achieves the same bandwidth as TCP, but exhibits faster convergent behaviors and has a smoother rate than existing schemes.

[1]  Prashant J. Shenoy,et al.  Multimedia streaming via TCP: an analytic performance study , 2004, MULTIMEDIA '04.

[2]  Injong Rhee,et al.  TEAR: TCP emulation at receivers – flow control for multimedia streaming , 2000 .

[3]  Carey L. Williamson,et al.  TCP Vegas Performance with Streaming Media , 2007, 2007 IEEE International Performance, Computing, and Communications Conference.

[4]  Ao Tang,et al.  Equilibrium and Fairness of Networks Shared by TCP Reno and Vegas/FAST , 2005, Telecommun. Syst..

[5]  Liang Guo,et al.  A spectrum of TCP-friendly window-based congestion control algorithms , 2003, TNET.

[6]  Yang Richard Yang,et al.  General AIMD congestion control , 2000, Proceedings 2000 International Conference on Network Protocols.

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

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

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

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

[11]  Songqing Chen,et al.  Delving into internet streaming media delivery: a quality and resource utilization perspective , 2006, IMC '06.

[12]  Lakshminarayanan Subramanian,et al.  One more bit is enough , 2005, SIGCOMM '05.

[13]  Jean-Yves Le Boudec,et al.  On the long-run behavior of equation-based rate control , 2002, IEEE/ACM Transactions on Networking.

[14]  Yuan-Cheng Lai,et al.  Taxonomy and Evaluation of TCP-Friendly Congestion-Control Schemes on Fairness, Aggressiveness, and Responsiveness , 2007, IEEE Network.

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

[16]  Deepak Bansal,et al.  Dynamic behavior of slowly-responsive congestion control algorithms , 2001, SIGCOMM.

[17]  Fernando Paganini,et al.  Linear stability of TCP/RED and a scalable control , 2003, Comput. Networks.

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

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

[20]  Larry L. Peterson,et al.  TCP Vegas: End to End Congestion Avoidance on a Global Internet , 1995, IEEE J. Sel. Areas Commun..

[21]  Vassilis Tsaoussidis,et al.  TCP smoothness and window adjustment strategy , 2006, IEEE Transactions on Multimedia.