TCP westwood: Bandwidth estimation for enhanced transport over wireless links

ABSTRACT

TCP Westwood (TCPW) is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless networks. The improvement is most significant in wireless networks with lossy links, since TCP Westwood relies on end-to-end bandwidth estimation to discriminate the cause of packet loss (congestion or wireless channel effect) which is a major problem in TCP Reno. An important distinguishing feature of TCP Westwood with respect to previous wireless TCP “extensions” is that it does not require inspection and/or interception of TCP packets at intermediate (proxy) nodes. Rather, it fully complies with the end-to-end TCP design principle. The key innovative idea is to continuously measure at the TCP source the rate of the connection by monitoring the rate of returning ACKs. The estimate is then used to compute congestion window and slow start threshold after a congestion episode, that is, after three duplicate acknowledgments or after a timeout. The rationale of this strategy is simple: in contrast with TCP Reno, which “blindly” halves the congestion window after three duplicate ACKs, TCP Westwood attempts to select a slow start threshold and a congestion window which are consistent with the effective bandwidth used at the time congestion is experienced. We call this mechanism faster recovery. The proposed mechanism is particularly effective over wireless links where sporadic losses due to radio channel problems are often misinterpreted as a symptom of congestion by current TCP schemes and thus lead to an unnecessary window reduction. Experimental studies reveal improvements in throughput performance, as well as in fairness. In addition, friendliness with TCP Reno was observed in a set of experiments showing that TCP Reno connections are not starved by TCPW connections. Most importantly, TCPW is extremely effective in mixed wired and wireless networks where throughput improvements of up to 550% are observed. Finally, TCPW performs almost as well as localized link layer approaches such as the popular Snoop scheme, without incurring the O/H of a specialized link layer protocol.

REFERENCES

• 1: Abouzeid, A.A, S. Roy, M. Azizoglu. Stochastic Modeling of TCP over Lossy link. INFOCOM 2000, Tel Aviv, Israel, March 2000.
• 2: Karl J. Åström , Björn Wittenmark, Computer-controlled systems (3rd ed.), Prentice-Hall, Inc., Upper Saddle River, NJ, 1997
• 3: Hari Balakrishnan , Venkata N. Padmanabhan , Srinivasan Seshan , Randy H. Katz, A comparison of mechanisms for improving TCP performance over wireless links, IEEE/ACM Transactions on Networking (TON), v.5 n.6, p.756-769, Dec. 1997 [doi>10.1109/90.650137]
• 4: Hari Balakrishnan , Srinivasan Seshan , Elan Amir , Randy H. Katz, Improving TCI/IP performance over wireless networks, Proceedings of the 1st annual international conference on Mobile computing and networking, p.2-11, November 13-15, 1995, Berkeley, California, United States [doi>10.1145/215530.215544]
• 5: Balakrishnan, H., and Randy H. Katz. Explicit Loss Notification and Wireless Web Performance. Proc. IEEE GLOBECOM'98 Internet Mini-Conference, Sydney, Australia, November 1998.
• 6: Bonald, T., Comparison of TCP Reno and TCP Vegas: Efficiency and Fairness. In Proceedings of PERFORMANCE'99, Istanbul, Turkey, October 1999.
• 7: Casetti, C., M. Gerla, S. Lee, S Mascolo and M. Sanadidi, "TCP with Faster Recovery", MILCOM 2000, Los Angeles, CA, October 2000.
• 8: D. Clark, The design philosophy of the DARPA internet protocols, Symposium proceedings on Communications architectures and protocols, p.106-114, August 16-18, 1988, Stanford, California, United States
• 9: Gerla, M., R. Lo Cigno, S. Mascolo, and W. Weng. Generalized Window Advertising for TCP Congestion Control. CSD-TR 990012, UCLA, CA, USA, February 1999.
• 10: Gerla, M., W. Weng and R. Cigno, "Bandwidth feedback control of TCP and real time sources in the Internet", GLOBECOM'2000, San Francisco, CA, USA, November 2000.
• 11: T. Henderson, Satellite Transport Protocol Specification. Technical Report, University of California, Berkeley, 1999.
• 12: Hengartner, U., J. Bolliger, and T. Gross. TCP Vegas Revisited. In Proceedings of IEEE INFOCOM'2000, Tel Aviv, Israel, March 2000.
• 13: V. Jacobson, Congestion avoidance and control, ACM SIGCOMM Computer Communication Review, v.18 n.4, p.314-329, August 1988
• 14: James F. Kurose , Keith W. Ross, Computer Networking: A Top-Down Approach Featuring the Internet Package, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2000
• 15: San-Qi Li , Song Chong , Chia-Lin Hwang, Link capacity allocation and network control by filtered input rate in high-speed networks, IEEE/ACM Transactions on Networking (TON), v.3 n.1, p.10-25, Feb. 1995 [doi>10.1109/90.365433]
• 16: Mathis, M., J. Mahdavi, S.Floyd, and A.Romanow. TCP Selective Acknowledgemwnt Options. RFC 2018, April 1996
• 17: Mitzel, D., Overviw of 2000 IAB Wireless Internetworking Workshop, RFC 3002.
• 18: W. Richard Stevens, TCP/IP illustrated (vol. 1): the protocols, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1993
• 19: ns-2 network simulator (ver 2). LBL, URL: http://wwwmash.cs.berkeley.edu/ns.
• 20: TCP Westwood modules for ns-2. URL: http://www.telematics.polito.it/casetti/tcp-westwood.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.2 Network Protocols

          Nouns: TCP/IP

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Wireless communication
  C.4 PERFORMANCE OF SYSTEMS
      Subjects: Performance attributes

General Terms:
Design, Measurement, Performance