International Journal of Computer Networks and Applications

Open Access Open Access  Restricted Access Subscription Access

Evaluation of TCP Congestion Control Modus Operandi in Mesh Networks


Affiliations
1 School of Informatics and Innovative Systems, Jaramogi Oginga Odinga University of Science and Technology, Kenya
 

In mesh networks, the sender machine is connected to the receiver machine via multiple paths. Efficient transmissions along these paths require proper link choice so as to quickly deliver the packets the destination. Poor link selection can lead to overutilization of some links while the other redundant links remain underutilized. Over-utilized links experience heavy congestions under peak hours. The transmission control protocol (TCP) employs congestion control algorithms to prevent transmitters from overloading the network with data. These algorithms include slow start, congestion avoidance, fast retransmit and fast recovery. The slow start algorithm is utilized during the initial communication phase while congestion avoidance, fast retransmit and fast recovery are reactionary algorithms one packet loss is detected. This paper aimed to analyze the behavior of TCP under these congestion control algorithms in wired mesh networks. The dimensions that were used for this analysis included three way handshake, packet loss, duplicate acknowledgements, segment retransmissions, recovery, I/O plots and time-sequence plots. The objective of this study was to practically understand how the TCP protocol detects and handles network congestions in mesh networks. To achieve this objective, an experimental research design was employed. It involved the practical design of experimental setups that were used to collect data that was analyzed to provide an explanation of the TCP congestion control mechanisms. The results obtained indicate that the TCP first carries out a three handshake before data transmission can take place. It was also observed that the receipt of three duplicate acknowledgements is interpreted by TCP to be packet loss caused by network congestion. Moreover, it was established that TCP initiates fast retransmit and fast recovery when packet loss is detected. The contribution of this paper lies in the fact that it provided a practical understanding of how TCP detects and reacts to mesh network congestion, a concept that is critical to network administrators in their quest for packet loss prevention over the TCP architecture. Towards the end of the paper, suggestions for developing better ways of congestion handling in mesh networks by use of round trip times as a basis for adaptive congestion detection and control are elaborated.

Keywords

TCP, Congestion, Throughput, Bandwidth, Algorithm.
User
Notifications
Font Size

  • H. Dave, V. Gupta, & P. Dihulia, “Performance comparison between TCP sack and TCP Vegas using NS-2 Simulator,” International Journal of Computer Application, 68(11), pp. 49-52, 2013.

  • M. Kavitha, B. Ramakrishnan and R. Das, “A Novel Routing Scheme to Avoid Link Error and Packet Dropping in Wireless Sensor Networks,” International Journal of Computer Networks and Applications (IJCNA), 3(4), PP: 86-94, 2016, DOI: 10.22247/ijcna/2016/v3/i4/48569.

  • N. Vlajic , “TCP: Congestion Control,” CSE 3214, PP: 1-20, 2016.

  • S. Stefan, N. Cardwell, D. Wetherall, and T. Anderson, “TCP Congestion Control with a Misbehaving Receiver,” Department of Computer Science and Engineering: University of Washington, Seattle, PP: 1-8, 2015.

  • R. Shankar and S. Naidu, “A Dynamic Approach of Malicious Node Detection for Internet Traffic Analysis,” International Journal of Computer Networks and Applications (IJCNA), 1(1), PP: 33-39, 2014.

  • Y. Nishida, “The NewReno Modification to TCP’s Fast Recovery Algorithm,” Standards Track, PP: 1-16, 2012.

  • A. Walid, Q. Peng, J. Hwang, and S. Low. “Balanced Linked Adaptation Congestion Control Algorithm for MPTCP”, Working Draft, IETF Secretariat, Internet-Draft, 2015.

  • Ahmed and N. Shinde, “A Simulation Technique for Wireless Mesh Networks to Present Its Topology and Evaluate Its Impact on Communication Revolution,” Communications and Network, 2016, DOI: 10.4236/cn.2016.81005.

  • M. Anuba and A. Anuja, “Energy Efficient Routing (EER) For Reducing Congestion and Time Delay in Wireless Sensor Network,” International Journal of Computer Networks and Applications (IJCNA), 1(1), PP: 1-10, 2014.

  • M. Hamzah, A. Hijawi and M. Mohammad, “Performance Analysis of Multi-Path TCP Network,” International Journal of Computer Networks & Communications (IJCNC), Vol.8, No.2, PP: 145-147, 2016.

  • Cao, Yu, Mingwei Xu, and Xiaoming Fu, “Delay-based congestion control for multipath TCP,” In Network Protocols (ICNP), IEEE International Conference on, pp. 1-10, IEEE, 2012.

  • J. VijiPriyal , S. Suppiah, “An Extended Study On Newton Raphson Congestion Control”, International Journal of Advanced Research, Volume 4, Issue 2, 2016.

  • Alrshah, Mohamed A., et al. "Agile-SD: a Linux-based TCP congestion control algorithm for supporting high-speed and short-distance networks." Journal of Network and Computer Applications 55 (2015): 181-190.

  • Kire Jakimoski, Slavcho Chungurski, Sime Arsenovski, Lidija Gorachinova, Oliver Iliev, Leonid Djinevski and Emilija Kamcheva. “Performance Analysis of Linux-Based TCP Congestion Control Algorithms in VANET Environment,” International Journal of Future Generation Communication and Networking (IJFGCN), Vol. 4, Issue 2, 2016.

  • S. Ogara, “Lecture Notes: Flow Control, Congestion Control and Error Control,” PP: 1-40, 2016.


Abstract Views: 289

PDF Views: 0




  • Evaluation of TCP Congestion Control Modus Operandi in Mesh Networks

Abstract Views: 289  |  PDF Views: 0

Authors

Vincent O. Nyangaresi
School of Informatics and Innovative Systems, Jaramogi Oginga Odinga University of Science and Technology, Kenya
Solomon O Ogara
School of Informatics and Innovative Systems, Jaramogi Oginga Odinga University of Science and Technology, Kenya
Silvance O. Abeka
School of Informatics and Innovative Systems, Jaramogi Oginga Odinga University of Science and Technology, Kenya

Abstract


In mesh networks, the sender machine is connected to the receiver machine via multiple paths. Efficient transmissions along these paths require proper link choice so as to quickly deliver the packets the destination. Poor link selection can lead to overutilization of some links while the other redundant links remain underutilized. Over-utilized links experience heavy congestions under peak hours. The transmission control protocol (TCP) employs congestion control algorithms to prevent transmitters from overloading the network with data. These algorithms include slow start, congestion avoidance, fast retransmit and fast recovery. The slow start algorithm is utilized during the initial communication phase while congestion avoidance, fast retransmit and fast recovery are reactionary algorithms one packet loss is detected. This paper aimed to analyze the behavior of TCP under these congestion control algorithms in wired mesh networks. The dimensions that were used for this analysis included three way handshake, packet loss, duplicate acknowledgements, segment retransmissions, recovery, I/O plots and time-sequence plots. The objective of this study was to practically understand how the TCP protocol detects and handles network congestions in mesh networks. To achieve this objective, an experimental research design was employed. It involved the practical design of experimental setups that were used to collect data that was analyzed to provide an explanation of the TCP congestion control mechanisms. The results obtained indicate that the TCP first carries out a three handshake before data transmission can take place. It was also observed that the receipt of three duplicate acknowledgements is interpreted by TCP to be packet loss caused by network congestion. Moreover, it was established that TCP initiates fast retransmit and fast recovery when packet loss is detected. The contribution of this paper lies in the fact that it provided a practical understanding of how TCP detects and reacts to mesh network congestion, a concept that is critical to network administrators in their quest for packet loss prevention over the TCP architecture. Towards the end of the paper, suggestions for developing better ways of congestion handling in mesh networks by use of round trip times as a basis for adaptive congestion detection and control are elaborated.

Keywords


TCP, Congestion, Throughput, Bandwidth, Algorithm.

References