Abstract
As a well-known issue, the performance of transmission control protocol (TCP) is affected by its loss recovery mechanism working based on two algorithms of fast retransmit and fast recovery. In particular, the fast recovery algorithm has been modified for improvement and become a basis on which each TCP implementation is differentiated such as TCP Tahoe, Reno, NewReno, and selective acknowledgement (SACK) option. Despite the recent improvement achieved in TCP NewReno and SACK option, TCP still has a problem that it cannot avoid retransmission timeout (RTO) when a retransmitted packet is lost. Therefore, in this paper, we introduce a simple algorithm for detecting a lost retransmission that can be applied to TCP implementations that do not use SACK option such as TCP Reno and NewReno. Using ns simulations, we show the microscopic behaviors of the lost retransmission detection algorithm when it works with each TCP. The numerical results based on existing analytic models are also shown.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Allman, M., Paxson, V., Stevens, W.: TCP Congestion Control. RFC 2581 (1999)
Jacobson, V.: Congestion Control and Avoidance. In: ACM SIGCOMM 1988 (1988)
Jacobson, V.: Modified TCP Congestion Avoidance Algorithm. note sent to end2end-interest mailing list, 314–329 (1990)
Hoe, J.C.: Improving the Start-Up Behavior of a Congestion Control Scheme for TCP. In: ACM SIGCOMM 1996 (1996)
Blanton, E., Allman, M., Fall, K., Wang, L.: A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP. RFC 3517 (2003)
Allman, M., Balakrishan, H., Floyd, S.: Enhancing TCP’s Loss Recovery Using Limited Transmit. RFC 3042 (2001)
Kim, B., Lee, J.: Retransmission Loss Recovery by Duplicate Acknowledgement Counting. IEEE Communications Letters 8(1), 69–71 (2004)
Kim, B., et al.: Lost Retransmission Detection for TCP Part 2: TCP using SACK option. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol. 3042, pp. 88–99. Springer, Heidelberg (2004)
Fall, K., Floyd, S.: Simulation-based Comparisons of Tahoe, Reno, and SACK TCP. ACM Computer Communication Review 26(3), 5–21 (1996)
A. Kumar: Comparative Performance Analysis of Versions of TCP in a Local Network with a Lossy Link. IEEE/ACM Trans. Networking, 6 (4) (1998) 485–498
Padhye, J., Firoiu, V., Towsley, D.F., Kurose, J.F.: Modeling TCP Reno Performance: A Simple Model and Its Empirical Validation. IEEE/ACM Trans. Networking 8(2), 133–145 (2000)
Kim, B., Lee, J.: Analytic Models of Loss Recovery of TCP Reno with Random Losses. In: Kahng, H.-K. (ed.) ICOIN 2003. LNCS, vol. 2662, pp. 938–947. Springer, Heidelberg (2003)
Kim, B., Lee, J.: A Simple Model for TCP Loss Recovery Performance over Wireless Networks. Int’l Journal of Communications and Networks (JCN) published by Korean Institute of Communication and Science (KICS) 6(3) (2004)
Kim, B., Kim, D., Lee, J.: Lost Retransmission Detection for TCP SACK. accepted for publication in IEEE Communications Letters (2004)
Braden, R.: Requirements for Internet Hosts. RFC 1122 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, B., Choi, YH., Park, J. (2004). Lost Retransmission Detection for TCP Part 1: TCP Reno and NewReno. In: Freire, M.M., Chemouil, P., Lorenz, P., Gravey, A. (eds) Universal Multiservice Networks. ECUMN 2004. Lecture Notes in Computer Science, vol 3262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30197-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-30197-4_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23551-4
Online ISBN: 978-3-540-30197-4
eBook Packages: Springer Book Archive