A Novel Approach to Enhance the Performance of TCP SACK on Wireless Links

International Journal of Electronics and Communication Engineering

© 2024 by SSRG - IJECE Journal

Volume 11 Issue 7

Year of Publication : 2024

Authors : Rahul Dhirendrabhai Mehta, Hitesh Thakarshibhai Loriya, Divyesh Rudabhai Keraliya

10.14445/23488549/IJECE-V11I7P110

How to Cite?

Rahul Dhirendrabhai Mehta, Hitesh Thakarshibhai Loriya, Divyesh Rudabhai Keraliya, "A Novel Approach to Enhance the Performance of TCP SACK on Wireless Links," SSRG International Journal of Electronics and Communication Engineering, vol. 11,  no. 7, pp. 98-107, 2024. Crossref, https://doi.org/10.14445/23488549/IJECE-V11I7P110

Abstract:

TCP has become one of the most prominent contributors to the TCP/IP protocol stack that drives the Internet. TCP is known for offering reliable, connection-oriented services to Internet users. TCP carries around 85% of the Internet traffic, which puts an immense responsibility on its shoulders to offer the utmost reliability and faster services. Unfortunately, the protocol that was initially developed for wired networks gradually became unable to cope with the issues offered by growing wireless networks and hence felt incompetent in providing quality services to competing Internet traffic. The researchers have shown keen interest in making TCP equally adaptive and competent to the growing networks; hence, revisions in basic TCP have started taking place. Over the decades of research, today's TCP has become completely different from its original version and competent enough to perform far better in the presence of various wireless links. However, the area where TCP is still lacking is the absence of intelligence to discriminate between the losses due to random errors and the losses due to congestion. This research paper focuses on adding adequate intelligence to differentiate between the types of losses and act accordingly. The proposed algorithm integrates unique modifications into an existing variant, TCP SACK, which passes the testing phase and performs quite superior to the original and older versions. The simulations are performed on a standard Network Simulator (ns-2), and plots are drawn from the traces of observations. Overall, the work is useful in enhancing the performance of SACK TCP on wireless erroneous links by adding the intelligence to differentiate between types of losses and act accordingly.

Keywords:

Congestion control, Fast recovery, Random loss, RTT, Selective ACKnowledgement (SACK), TCP.

References:

[1] Maulin Patel et al., “TCP over Wireless Networks: Issues, Challenges and Survey of Solutions,” University of Texas, Dallas, pp. 1-23, 2001.
[Google Scholar]
[2] C. Barakat, E. Altman, and W. Dabbous, “On TCP Performance in a Heterogeneous Network: A Survey,” IEEE Communications Magazine, vol. 38, no. 1, pp. 40-46, 2000.
[CrossRef] [Google Scholar] [Publisher Link]
[3] J. Postel, “Transmission Control Protocol,” Information Sciences Institute, University of Southern California, 1981.
[Google Scholar] [Publisher Link]
[4] Kevin Fall, and Sally Floyd, “Simulation-Based Comparisons of Tahoe, Reno and SACK TCP,” ACM SIGCOMM Computer Communication Review, vol. 26, no. 3, pp. 5-21, 1996.
[CrossRef] [Google Scholar] [Publisher Link]
[5] Andrei Gurtov et al., “The NewReno Modification to TCP’s Fast Recovery Algorithm,” RFC 2582, 1999.
[Google Scholar] [Publisher Link]
[6] M. Mathis et al., “TCP Selective Acknowledgment Options,” RFC 2018, 1996.
[Google Scholar] [Publisher Link]
[7] N.J. Kothari, and K.S. Dasgupta, “Performance Enhancement of SACK TCP Protocol for a Wireless Network by Delaying Fast Recovery,” 2006 IFIP International Conference on Wireless and Optical Communications Networks, Bangalore, India, pp. 1-5, 2006.
[CrossRef] [Google Scholar] [Publisher Link]
[8] Nikhil J. Kothari, Bhavika M. Gambhava, and K.S. Dasgupta, “Adaptive Flow Control: An Extension to Delayed Fast Recovery,” 15th International Conference on Advanced Computing and Communications (ADCOM 2007), Guwahati, India, pp. 620-625, 2007.
[CrossRef] [Google Scholar] [Publisher Link]
[9] Andrei Gurtov, and Sally Floyd, “Modeling Wireless Links for Transport Protocols,” ACM SIGCOMM Computer Communication Review, vol. 34, no. 2, pp. 85-96, 2004.
[CrossRef] [Google Scholar] [Publisher Link]
[10] Teerawat Issariyakul, and Ekram Hossain, Introduction to Network Simulator NS2, Springer, 2011.
[CrossRef] [Google Scholar] [Publisher Link]
[11] Matthew Mathis et al., “The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm,” ACM SIGCOMM Computer Communication Review, vol. 27, no. 3, pp. 67-82, 1997.
[CrossRef] [Google Scholar] [Publisher Link]
[12] M. Allman, S. Floyd, and C. Partridge, “Increasing TCP’s Initial Window,” RFC 3390, 1998.
[Google Scholar] [Publisher Link]
[13] W. Richard Stevens, “TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms,” RFC 2001, 1997.
[Google Scholar] [Publisher Link]
[14] M. Allman, V. Paxson, and W. Stevens, “TCP Congestion Control,” RFC 2581, 1999.
[Google Scholar] [Publisher Link]