scholarly journals Enhanced Multistream Fast TCP: Rapid Bandwidth Utilization after Fast-Recovery Phase

2019 ◽  
Vol 9 (21) ◽  
pp. 4698
Author(s):  
Sarfraz Ahmad ◽  
Muhammad Junaid Arshad
Keyword(s):  
Congestion Control ◽  
High Speed ◽  
Recovery Phase ◽  
Transport Layer ◽  
Convergence Time ◽  
Transmission Protocol ◽  
Fast Recovery ◽  
Congestion Window ◽  
Fast Tcp ◽  
Network Bandwidth

The purpose of this study is to enhance the performance of Multistream Fast Transmission Control Protocol (TCP) keeping in view the recent web-based applications that are being deployed on long-range, high-speed, and high-bandwidth networks. To achieve the objective of the research study, a congestion control after fast-recovery module for congestion control scheme of Multistream Fast TCP is proposed. The module optimized the performance of the protocol by reducing the time that is required to consume the available bandwidth after a fast-recovery phase. The module is designed after studying additive-increase, multiplicative-decrease and rate-based congestion window management schemes of related transport protocols. The module adjusts the congestion window on receipt of each individual acknowledgment instead of each round trip time after the fast-recovery phase until it consumes vacant bandwidth of the network link. The module is implemented by using Network Simulator 2. Convergence time, throughput, fairness index, and goodput are the parameters used to assess the performance of proposed module. The results indicate that Enhanced Multistream Fast TCP with congestion control after fast recovery recovers its congestion window in a shorter time period as compared to multistream Fast TCP, Fast TCP, TCP New Reno, and Stream Control Transmission Protocol. Consequently, Enhanced Multistream Fast TCP consumes the available network bandwidth in lesser time and increases the throughput and goodput. The proposed module enhanced the performance of the transport layer protocol. Our findings demonstrate the performance impact in the form of a decrease in the convergence time to consume the available network bandwidth and the increase in the throughput and the goodput.

TCP for High-Speed Networks

2008 ◽  
pp. 626-632
Author(s):  
Nelson Luís Saldanha da Fonseca ◽  
Neila Fernanda Michel
Keyword(s):  
Congestion Control ◽  
High Speed ◽  
Transmission Control Protocol ◽  
Window Size ◽  
Transport Layer ◽  
The Internet ◽  
Congestion Window ◽  
High Speed Networks ◽  
Congestion Control Mechanism ◽  
Tcp Reno

In response to a series of collapses due to congestion on the Internet in the mid-’80s, congestion control was added to the transmission control protocol (TCP) (Jacobson, 1988), thus allowing individual connections to control the amount of traffic they inject into the network. This control involves regulating the size of the congestion window (cwnd) to impose a limit on the size of the transmission window. In the most deployed TCP variant on the Internet, TCP Reno (Allman, Floyd, & Partridge, 2002), changes in congestion window size are driven by the loss of segments. Congestion window size is increased by 1/cwnd for each acknowledgement (ack) received, and reduced to half for the loss of a segment in a pattern known as additive increase multiplicative decrease (AIMD). Although this congestion control mechanism was derived at a time when the line speed was of the order of 56 kbs, it has performed remarkably well given that the speed, size, load, and connectivity of the Internet have increased by approximately six orders of magnitude in the past 15 years. However, the AIMD pattern of window growth seriously limits efficienct operation of TCP-Reno over high-capacity links, so that the transport layer is the network bottleneck. This text explains the major challenges involved in using TCP for high-speed networks and briefly describes some of the variations of TCP designed to overcome these challenges.

A Fair Algorithm of Congestion Control to Improve HSTCP

2010 ◽  
Vol 34-35 ◽  
pp. 1425-1430
Author(s):  
Dong En Guo ◽  
Bing Jin ◽  
Yan Shen
Keyword(s):  
Congestion Control ◽  
High Speed ◽  
Simulation Test ◽  
Long Distance ◽  
Simulation Experiments ◽  
Network Bandwidth ◽  
Ns2 Simulation

Standard TCP has lots of problems; for example, the network bandwidth can not give its full play in certain application conditions such as high speed or long distance. High Speed TCP (HSTCP) can solve these problems, but it has serious problems in the fairness of different RTT. Based on the analysis of HSTCP fairness, an algorithm of adding fair factors to improve fairness of HSTCP has been put forward after fairness simulation test by NS2. NS2 simulation experiments prove that this algorithm has greatly reduced the unfairness because of the different RTT.

TCP Symbiosis

2012 ◽  
pp. 104-131
Author(s):  
Go Hasegawa ◽  
Masayuki Murata
Keyword(s):  
Window Size ◽  
Convergence Time ◽  
Logistic Growth ◽  
Fast Tcp ◽  
Network Bandwidth ◽  
Scalable Tcp ◽  
Logistic Growth Model ◽  
Congestion Control Mechanism ◽  
Tcp Reno ◽  
Time Fairness

In this chapter, we introduce a robust, self-adaptive and scalable congestion control mechanism for TCP. We change the window size of a TCP connection according to the information of the physical and available bandwidths of the end-to-end network path. The bandwidth information is obtained by an inline network measurement technique. We also borrowed algorithms from biophysics to update the window size: the logistic growth model and the Lotka-Volterra competition model. The greatest advantage of using these models is that we can refer previous discussions and results for various characteristics of the mathematical models, including scalability, convergence, fairness and stability in these models. Through mathematical analysis and simulation experiments, we compare the proposed mechanism with traditional TCP Reno, HighSpeed TCP, Scalable TCP and FAST TCP, and exhibit its effectiveness in terms of scalability to the network bandwidth and delay, convergence time, fairness among competing connections, and stability.

scholarly journals SCTPCD: A Cross Layer Transport Layer Protocol For Highly Dynamic Environment

2012 ◽  
Vol 58 (1) ◽  
Author(s):  
Hala Eldaw Idris Jubara ◽  
Sharifah Hafizah Syed Ariffin ◽  
Norsheila Fisal
Keyword(s):  
High Speed ◽  
Dynamic Environment ◽  
Transport Layer ◽  
Cross Layer ◽  
Cross Layer Design ◽  
Transmission Protocol ◽  
Mobile Nodes ◽  
Transport Layer Protocol ◽  
Smooth Handoff ◽  
Wireless Mobile Communication

Computer and wireless mobile communication need Internet accessibility at anytime and anywhere and this includes in high-speed wireless environment such as in high speed trains, fast moving cars as vehicle-to-infrastructure (V2I) communication. However, wireless qualities of service (QoS) provisioning in such environment are more challenging. This increases the development of numerous schemes concerning the need of smooth handoff of the mobile nodes. Transport layer protocols can support seamless handover in such high speed mobility. This paper highlights on the issues of moving users in WiMAX network. A cross-layer design of Transport Layer protocol which is called cross-layer design of Stream Control Transmission Protocol and BS handover messages (SCTPcd) is able to guarantee and maintain QoS for high-speed vehicle. The cross-layer allows information to be exchanged and shared across layer boundaries in order to enable efficient and robust mobility aware protocols.

Proactive congestion control for high speed networks

2003 ◽  
Vol 43 (6) ◽  
pp. 761-775
Author(s):  
Tamer Dağ ◽  
Ioannis Stavrakakis
Keyword(s):  
Congestion Control ◽  
High Speed ◽  
High Speed Networks
Sign in / Sign up

Export Citation Format

Share Document