Improving TCP performance in integrated wireless communications networks

Many analytical and simulation-based studies of TCP performance in wireless environments assume an error-free and congestion-free reverse channel that has the same capacity as the forward channel. Such an assumption does not hold in many real-world scenarios, particularly in the hybrid networks consisting of various wireless LAN (WLAN) and cellular technologies. In this paper, we first study, through extensive simulations, the performance characteristics of four representative TCP schemes, namely TCP New Reno. SACK, Veno, and Westwood, under the network conditions of asymmetric end-to-end link capacities, correlated wireless errors, and link congestion in both forward and reverse directions. We then propose a new TCP scheme, called TCP New Jersey, which is capable of distinguishing wireless packet losses from congestion packet losses, and reacting accordingly. TCP New Jersey consists of two key components, the timestamp-based available bandwidth estimation (TABE) algorithm and the congestion warning (CW) router configuration. TABE is a TCP-sender-side algorithm that continuously estimates the bandwidth available to the connection and guides the sender to adjust its transmission rate when the network becomes congested. TABE is immune to the ACK drops as well as ACK compression. CW is a configuration of network routers such that routers alert end stations by marking all packets when there is a sign of an incipient congestion. The marking of packets by the CW-configured routers helps the sender of the TCP connection to effectively differentiate packet losses caused by network congestion from those caused by wireless link errors. Our simulation results show that TCP New Jersey is able to accurately estimate the available bandwidth of the bottleneck link of an end-to-end path; and the TABE estimator is immune to link asymmetry, bi-directional congestion, and the relative position of the bottleneck link in the multi-hop end-to-end path. The proactive congestion avoidance control mechanism proposed in our scheme minimizes the network congestion, reduces the network volatility, and stabilizes the queue lengths while achieving more throughput than other TCP schemes.

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

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

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

[4]  Janey C. Hoe Improving the start-up behavior of a congestion control scheme for TCP , 1996, SIGCOMM '96.

[5]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[6]  F. Lefevre,et al.  Understanding TCP's behavior over wireless links , 2000, IEEE Benelux Chapter on Vehicular Technology and Communications. Symposium on Communications and Vehicular Technology. SCVT-2000. Proceedings (Cat. No.00EX465).

[7]  Soung Chang Liew,et al.  TCP Veno: TCP enhancement for transmission over wireless access networks , 2003, IEEE J. Sel. Areas Commun..

[8]  Sally Floyd,et al.  The NewReno Modification to TCP's Fast Recovery Algorithm , 2004, RFC.

[9]  Bogdan M. Wilamowski,et al.  The Transmission Control Protocol , 2005, The Industrial Information Technology Handbook.

[10]  Sally Floyd,et al.  TCP Selective Acknowledgement Options , 1996 .

[11]  Sally Floyd,et al.  The NewReno Modification to TCP's Fast Recovery Algorithm , 2004, RFC.

[12]  Andreas Willig,et al.  A Gilbert-Elliot Bit Error Model and the Efficient Use in Packet Level Simulation , 1999 .

[13]  Sally Floyd,et al.  TCP Selective Acknowledgment Options , 1996, RFC.

[14]  Van Jacobson,et al.  TCP Extensions for High Performance , 1992, RFC.

[15]  T. V. Lakshman,et al.  The performance of TCP/IP for networks with high bandwidth-delay products and random loss , 1997, TNET.

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

[17]  Kang G. Shin,et al.  A simple refinement of slow-start of TCP congestion control , 2000, Proceedings ISCC 2000. Fifth IEEE Symposium on Computers and Communications.

[18]  Martin May,et al.  Analytic evaluation of RED performance , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[19]  Alhussein A. Abouzeid,et al.  Comprehensive performance analysis of a TCP session over a wireless fading link with queueing , 2003, IEEE Trans. Wirel. Commun..

[20]  Jon Postel,et al.  Internet Protocol , 1981, RFC.

[21]  A. Chockalingam,et al.  Throughput analysis of TCP on channels with memory , 2000, IEEE Journal on Selected Areas in Communications.

[22]  Ibrahim Matta,et al.  Open issues on TCP for mobile computing , 2001, Wirel. Commun. Mob. Comput..

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

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

[25]  Kai Xu,et al.  TCP-Jersey for wireless IP communications , 2004, IEEE Journal on Selected Areas in Communications.