Abstract
The initial TCP Tahoe version uses the slow-start algorithm to deal with flow control and congestion avoidance. The later Reno version deploys both fast-retransmit and fast-recovery algorithms. Traditionally a segment loss is considered as owing to the network congestion. However, a packet loss may be caused by some other reason such as a transmission error in the wireless link. Due to this reason, we design a mechanism that subdivides the congestion control mechanism into two parts, the packet loss indication and the loss recovery. Regarding the former, we no longer treat the packet loss caused by the transmission error as an indication of network congestion. While for the latter, we proposed a modified scoreboard algorithm in TCP FACK to quickly recover the packet loss and prevent the retransmitted packet from being lost again.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Brakmo, S. O’Malley, and L. Peterson, “TCP Vegas: End-to-End Congestion Control in a Global Internet.” IEEE Journal on Selected Areas in Communications (JSAC), 13(8):1465–1480, October 1995.
K. Fall and S. Floyd. “Simulation-based comparisons of Tahoe, Reno, and SACK TCP.” ACM Computer Communication Review, 26(3):5–21, July 1996.
S. Floyd. “TCP and Successive Fast Retransmission”, February 1995. ftp://ftp.ee.lbl.gov/papers/fastretrans.ps
J. Hoe. “Start-up Dynamics of TCP’s Congestion Control and Avoidance Schemes,” Master’s Thesis, MIT. June 1995
J. Hoe. “Improving the Start-up Behavior of a Congestion Control Scheme for TCP,”. SIGCOMM Symposium on Communications Architectures and Protocols, August 1996.
V. Jacobson. Jacobson, “Congestion Avoidance and Control,” in Proc. SIGCOMM’88 Symp., August 1988, pp.314–329.
R. Jain, “ A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks,” ACM Computer Communication Review, vol. 19 no. 5, pp.56–71, Oct. 1989.
Phil Karn and Craig Partridge. Improving Round-Trip Time Estimates in Reliable Transport Protocols. ACM SIGCOMM, pages 2–7, August 1987.
M. Mathis and J. Mahdavi. “Forward Acknowledgement (FACK): Refining TCP Congestion control.” Proceedings of ACM SIGCOMM’96, pages 281–291, August 1996.
M. Mathis and J. Mahdavi, S. Floyd, and A. Romanow. TCP selective acknowledgement option. Internet Draft, work in progress, May 1996.
S. McCanne and S. Floyd. UCB/LBNL/VINT Network Simulator-ns(version 2) network simulator, http://www-mash.cs.berkerley.edu/ns/
W. Stevens, TCP/IP Illustrated, Volume 1. Addison-Wesley, 1994.
W. Stallings, High-Speed Networks, TCP/IP and ATM Design Principles. Prentice-Hall, 1998.
Gary R. Wright and W. Richard Stevens. TCP/IP Illustrated, Volume II: The Implementation. Addison-Wesley, 1995.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liao, H.Y., Chen, Y.C., Lee, C.L. (2001). An Efficient TCP Flow Control and Fast Recovery Scheme for Lossy Networks. In: Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47734-9_9
Download citation
DOI: https://doi.org/10.1007/3-540-47734-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42303-4
Online ISBN: 978-3-540-47734-1
eBook Packages: Springer Book Archive