F-RTO: an enhanced recovery algorithm for TCP retransmission timeouts

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.

REFERENCES

• 1: Mark Allman, A web server's view of the transport layer, ACM SIGCOMM Computer Communication Review, v.30 n.5, October 2000 [doi>10.1145/505672.505674]
• 2: M. Allman, H. Balakrishnan, and S. Floyd. Enhancing TCP's Loss Recovery Using Limited Transmit. RFC 3042, January 2001.
• 3: Mark Allman , Vern Paxson, On estimating end-to-end network path properties, Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, p.263-274, August 30-September 03, 1999, Cambridge, Massachusetts, United States
• 4: M. Allman, V. Paxson, and W. Stevens. TCP Congestion Control. RFC 2581, April 1999.
• 5: Ethan Blanton , Mark Allman, On making TCP more robust to packet reordering, ACM SIGCOMM Computer Communication Review, v.32 n.1, p.20-30, January 2002 [doi>10.1145/510726.510728]
• 6: E. Blanton, M. Allman, K. Fall, and L. Wang. A Conservative Selective Acknowledgement (SACK)-based Loss Recovery Algorithm for TCP. RFC 3517, April 2003.
• 7: D. Borman, R. Braden, and V. Jacobson. TCP Extensions for High Performance. RFC 1323, May 1992.
• 8: J. Cai and D. J. Goodman. General packet radio service in GSM. IEEE Communications Magazine, pages 122--131, October 1997.
• 9: M. Degermark, B. Nordgren, and S. Pink. IP Header Compression. RFC 2507, February 1999.
• 10: S. Floyd and T. Henderson. The NewReno Modification to TCP's Fast Recovery Algorithm. RFC 2582, April 1999.
• 11: S. Floyd, J. Mahdavi, M. Mathis, and M. Podolsky. An Extension to the Selective Acknowledgment (SACK) Option for TCP. RFC 2883, July 2000.
• 12: A. Gurtov and R. Ludwig. Response to Spurious Retransmission Timeouts. In Proceedings of IEEE Infocom 2003.
• 13: A. Gurtov and R. Ludwig. Evaluating the Eifel Algorithm for TCP in a GPRS Network. In Proceedings of European Wireless '02, February 2002.
• 14: V. Jacobson. Compressing TCP/IP headers for low-speed serial links. RFC 1144, February 1990.
• 15: F. Khafizov and M. Yavuz. Running TCP over IS-2000. In Proceedings of IEEE ICC 2002, April 2002. To appear.
• 16: 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.
• 17: Almudena Konrad , Ben Y. Zhao , Anthony D. Joseph , Reiner Ludwig, A Markov-based channel model algorithm for wireless networks, Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems, p.28-36, July 2001, Rome, Italy [doi>10.1145/381591.381602]
• 18: Reiner Ludwig , Randy H. Katz, The Eifel algorithm: making TCP robust against spurious retransmissions, ACM SIGCOMM Computer Communication Review, v.30 n.1, January 2000 [doi>10.1145/505688.505692]
• 19: R. Ludwig , K. Sklower, The Eifel retransmission timer, ACM SIGCOMM Computer Communication Review, v.30 n.3, p.17-27, July 2000 [doi>10.1145/382179.383014]
• 20: M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow. TCP Selective Acknowledgement Options. RFC 2018, October 1996.
• 21: G. Montenegro, S. Dawkins, M. Kojo, V. Magret, and N. Vaidya. Long Thin Networks. RFC 2757, January 2000.
• 22: V. Paxson and M. Allman. Computing TCP's Retransmission Timer. RFC 2988, November 2000.
• 23: J. Postel. Transmission Control Protocol. RFC 793, September 1981.
• 24: Pasi Sarolahti , Alexey Kuznetsov, Congestion Control in Linux TCP, Proceedings of the FREENIX Track: 2002 USENIX Annual Technical Conference, p.49-62, June 10-15, 2002