Pasi Sarolahti
Abstract
Spurious TCP retransmission timeouts (RTOs) have been reported to be a problem on network paths involving links that are prone to sudden delays due to various reasons. Especially many wireless network technologies contain such links. Spurious retransmission timeouts often cause unnecessary retransmission of several segments, which is harmful for TCP performance. Recent proposals for avoiding unnecessary retransmissions after a spurious RTO require use of TCP options which must be implemented and enabled at both ends of teh connection. We introduce a new TCP sender algorithm for recovery after a retransmission timeout and show that unnecessary retransmissions after a spurious retransmission timeout, improving the TCP performance considerably. The algorithm is friendly towards other TCP connections, because it follows the congestion control principles and injects packets to the network at same rate as a conventional TCP sender. We implemented the algorithm and compared its performance to conventional TCP and Eifel TCP when RTOs occurred either due to sudden delays or due to packet losses. The results show that our algorithm either improves performance or gives similar througput as the other TCP variants evaluated in different test cases.
- M. Allman. A Web Server's View of the Transport Layer. ACM Computer Communication Review, 30(5), October 2000.]] Google Scholar
Digital Library
- M. Allman, H. Balakrishnan, and S. Floyd. Enhancing TCP's Loss Recovery Using Limited Transmit. RFC 3042, January 2001.]] Google ScholarDigital Library
- M. Allman and V. Paxson. On Estimating End-to-End Network Path Properties. In Proceedings of ACM SIGCOMM '99, September 1999.]] Google ScholarDigital Library
- M. Allman, V. Paxson, and W. Stevens. TCP Congestion Control. RFC 2581, April 1999.]] Google ScholarDigital Library
- E. Blanton and M. Allman. On Making TCP More Robust to Packet Recordering. ACM Computer Communication Review, 32(1), January 2002.]] Google ScholarDigital Library
- E. Blanton, M. Allman, K. Fall, and L. Wang. A Conservative Selective Acknowledgement (SACK)-based Loss Recovery Algorithm for TCP. RFC 3517, April 2003.]] Google ScholarDigital Library
- D. Borman, R. Braden, and V. Jacobson. TCP Extensions for High Performance. RFC 1323, May 1992.]]Google Scholar
- J. Cai and D. J. Goodman. General packet radio service in GSM. IEEE Communications Magazine, pages 122--131, October 1997.]]Google Scholar
- M. Degermark, B. Nordgren, and S. Pink. IP Header Compression. RFC 2507, February 1999.]] Google ScholarDigital Library
- S. Floyd and T. Henderson. The NewReno Modification to TCP's Fast Recovery Algorithm. RFC 2582, April 1999.]] Google ScholarDigital Library
- S. Floyd, J. Mahdavi, M. Mathis, and M. Podolsky. An Extension to the Selective Acknowledgment (SACK) Option for TCP. RFC 2883, July 2000.]] Google ScholarDigital Library
- A. Gurtov and R. Ludwig. Response to Spurious Retransmission Timeouts. In Proceedings of IEEE Infocom 2003.]]Google Scholar
- A. Gurtov and R. Ludwig. Evaluating the Eifel Algorithm for TCP in a GPRS Network. In Proceedings of European Wireless '02, February 2002.]]Google Scholar
- V. Jacobson. Compressing TCP/IP headers for low-speed serial links. RFC 1144, February 1990.]] Google ScholarDigital Library
- F. Khafizov and M. Yavuz. Running TCP over IS-2000. In Proceedings of IEEE ICC 2002, April 2002. To appear.]]Google ScholarCross Ref
- M. Kojo, A. Gurtov, J. Manner, P. Sarolahti, T. Alanko, and K. Raatikainen. Seawind: a Wireless Network Emulator. In Proceedings of 11th GI/ITG Conference on Measuring, Modelling and Evaluation of Computer and Communication Systems, pages 151--166, Aachen, Germany, September 2001. VDE Verlag.]]Google Scholar
- A. Konrad, B. Y. Zhao, A. Joseph, and R. Ludwig. A Markov-Based Channel Model Algorithm for Wireless Networks. In Proceedings of ACM MSWiM 2001, pages 28--36, Rome, Italy, July 2001.]] Google ScholarDigital Library
- R. Ludwig and R. H. Katz. The Eifel Algorithm: Making TCP Robust Against Spurious Retransmissions. ACM Computer Communication Review, 30(1), January 2000.]] Google ScholarDigital Library
- R. Ludwig and K. Sklower. The Eifel Retransmission Timer. ACM Computer Communication Review, 30(3), July 2000.]] Google ScholarDigital Library
- M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow. TCP Selective Acknowledgement Options. RFC 2018, October 1996.]] Google ScholarDigital Library
- G. Montenegro, S. Dawkins, M. Kojo, V. Magret, and N. Vaidya. Long Thin Networks. RFC 2757, January 2000.]] Google ScholarDigital Library
- V. Paxson and M. Allman. Computing TCP's Retransmission Timer. RFC 2988, November 2000.]] Google ScholarDigital Library
- J. Postel. Transmission Control Protocol. RFC 793, September 1981.]]Google Scholar
- P. Sarolahti and A. Kuznetsov. Congestion Control in Linux TCP. In Proceedings of Usenix 2002/Freenix Track, pages 49--62, Monterey, CA, USA, June 2002.]] Google ScholarDigital Library
Index Terms
- F-RTO: an enhanced recovery algorithm for TCP retransmission timeouts
Recommendations
F-TCP: A Delay-Based Protocol with Fair Co-existence
ICN '10: Proceedings of the 2010 Ninth International Conference on NetworksVarious studies have shown that regular TCP is inefficient in high-speed networks. This paper proposes F-TCP, a delay-based TCP variant, which is able to operate efficiently in high-speed networks. The slowstart phase of F-TCP continues until a ...
Comments