Refine your search
Collections
Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Abeka, Silvance O.
- Evaluation of TCP Congestion Control Modus Operandi in Mesh Networks
Abstract Views :264 |
PDF Views:0
Authors
Affiliations
1 School of Informatics and Innovative Systems, Jaramogi Oginga Odinga University of Science and Technology, KE
1 School of Informatics and Innovative Systems, Jaramogi Oginga Odinga University of Science and Technology, KE
Source
International Journal of Computer Networks and Applications, Vol 4, No 1 (2017), Pagination: 15-26Abstract
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
- 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.
- Congestion Aware Packet Routing for Delay Sensitive Cloud Communications
Abstract Views :264 |
PDF Views:3
Authors
Affiliations
1 School of Informatics & Innovative Systems, Jaramogi Oginga Odinga University of Science & Technology, KE
1 School of Informatics & Innovative Systems, Jaramogi Oginga Odinga University of Science & Technology, KE
Source
International Journal of Computer Networks and Applications, Vol 4, No 4 (2017), Pagination: 93-104Abstract
In the recent years, many organizations have turned to cloud technology to support their information technology services. The cloud servers are therefore increasingly holding huge and sensitive information belonging to diverse groups of individuals and companies. Additionally, some organizations employ the cloud to provide them with online backup services. One of the most outstanding requirements for cloud customers is availability – the customers must be able to access their information and other resources stored in the cloud any time and from anywhere on the globe. This means that there should be efficient network design such that any delays are averted. The connection between the customer and the cloud can therefore be regarded as delay senstive. Network congestions often lead to delays and packet losses. Transmission control protocol employs four congestion control algorithms – slow start, congestion avoidance, fast retransmit and fast recovery, all of which fail to meet the requirements of delay intolerance. Transmission control protocol pacing has been suggested as a possible solution to delays and packet dropping in computer networks. However, the conventional pacing is static in nature, meaning that constant pauses are introduced between packet transmissions to prevent bursty transmissions which can lead to delays at the receiver buffers. This paper therefore presents a congestion aware packet routing where the delay period is hinged on the prevailing network conditions. This dynamic pacing algorithm was designed and implemented in Spyder using Python programming language. It employed probe signals to gather network intelligence such as the applicable round trip times of the network. Thereafter, this network intelligence was employed to tailor the paces to these network conditions. The results obtained showed that this algorithm introduced longer paces when more packets are transmitted and shorter paces when few packets are transmitted. In so doing, this new algorithm gives enough time for large packets to be delivered and smaller paces when few packets are sent. The analysis was done in terms of bandwidth utilization efficiency, round trip times and congestion window size adjustments. The congestion window – time graphs and throughput – time graphs showed that the developed dynamic pacing algorithm adjusted quickly to network congestions hence ensuring that the network is efficiently utilized by averting delaysKeywords
Cloud Computing, Congestion, Network Delays, Algorithm, TCP Pacing.References
- Nouh, May Sayed A., et al. "Enhanced Route Discovery Mechanism of Ad-Hoc On Demand Distance Vector for MANET." International Journal of Computer Networks and Applications (IJCNA) 3.6: 129-138, 2016, DOI: 10.22247/ijcna/2016/48904
- N. Tanida, M. Inaba, and K. Hiraki, “Adaptive auto-tuning of TCP pacingâ€, The University of Tokyo, Hongo Bunkyo Tokyo, Japan, pp. 1-14, 2015.
- A. Aggarwal, S. Savage, and T. Anderson, “Understanding the Performance of TCP Pacingâ€, Department of Computer Science and Engineering University of Washington Seattle, pp. 1-9, 2015.
- A.Nabil, T. Patrick, K. Robert, N. Vijay, M. Thomas, and B. Arkady, “ Secure and Resilient Cloud Computing for the Department of Defenseâ€, Lincoln Laboratory Journal, Vol. 22, No. 1, pp. 123-135, 2016.
- D. Sakhuja & A. Shukla, “Cloud Computingâ€, International Journal of Engineering Research & Technology (IJERT), Vol. 2, Issue 3, pp. 1-7, 2013.
- B. Dennis, “Impact of Virtualization on Data Center Physical Infrastructureâ€, The Green grid, Vol. 27, pp. 1-10, 2010.
- S. Karolj, D. Davor, A. Enis, S. Ivan, S. Zorislav, “Scalable Distributed Computing Hierarchy: Cloud, Fog and Dew Computingâ€, Open Journal of Cloud Computing, Vol. 2 (1), pp. 16–24, 2015.
- M. Haghighat, S. Zonouz & M. Abdel-Mottaleb, “CloudID: Trustworthy Cloud-based and Cross-Enterprise Biometric Identificationâ€, Expert Systems with Applications, Vol. 42, No. 21, pp. 7905–7916, 2015.
- C. Lehmann, “ Hybrid multi-cloud architecture, and the vendors aiming to enable and manage itâ€, 451 Research, LLC, pp. 1-6, 2016.
- M. Duke, R. Braden, W. Eddy, E. Blanton & A. Zimmermann, “A Roadmap for Transmission Control Protocol (TCP) Specification Documentsâ€, Internet Engineering Task Force (IETF), pp. 1-57, 2015.
- M. Ghobadi and Y. Ganjali, “TCP Pacing in Data Center Networksâ€, IEEE 21st Annual Symposium on High-Performance Interconnects, pp. 1-8, 2013.
- K. Chaubey and P. Mistri, “An Encounter Based Routing in Delay Tolerant Network (DTN): A Hybrid Approachâ€, International Journal Of Innovative Research In Computer And Communication Engineering, Vol. 4, Issue 5, pp. 8657 - 8662 , 2016. DOI: 10.15680/IJIRCCE.2016. 0405085.
- N. Dayanand and A. Vidhate, “Improved Routing Protocol for Delay Tolerant Networkâ€, International Journal of Advanced Research in Computer Science and Software Engineering, Vol. 6, Issue 4, pp. 688- 691, 2016.
- S. Islam and M. Welzl, “Start Me Up: Determining and Sharing TCP’s Initial Congestion Windowâ€, ACM, pp. 1-3, 2016. DOI: http://dx.doi.org/10.1145/2959424.2959440.
- Rohini, G., and A. Srinivasan. "Dynamic Transition of Bandwidth and Power Saving Mechanism to Support Multimedia Streaming Using H. 264/SVC over the Wireless Networks." International Journal of Computer Networks and Applications 2.2 (2015): 57-63.
- Merlyn, A. Anuba, and A. Anuja Merlyn. "Energy Efficient Routing (EER) For Reducing Congestion and Time Delay in Wireless Sensor Network." International Journal of Computer Networks and Applications 1.1 (2014): 1-10.
- N. Hanford, B. Tierney and D. Ghosal, “Optimizing Data Transfer Nodes using Packet Pacingâ€, ACM, pp. 1-8, 2015, DOI: http://dx.doi.org/10.1145/2830318.2830322.
- Y. Cai, Y. Sinan and T. Wolf, “Practical Packet Pacing in Small-Buffer Networksâ€, Department of Electrical and Computer Engineering University of Massachusetts, pp. 1-6, 2016.
- F. Gratzer, “QUIC - Quick UDP Internet Connectionsâ€, Seminars FI / IITM SS 16, Network Architectures and Services, pp. 36-46, 2016, DOI: 10.2313/NET-2016-09-1_06.
- W. Wang, L.Huang, C. Li, and X. Wang, “TCP-polite rate control based on cooperative measurementâ€, John Wiley & Sons, Ltd, Vol. 9, Issue 9 , pp. 899–909 ,2013, DOI: 10.1002/sec.901.