scholarly journals Improving Congestion Control of TCP for Constrained IoT Networks

Sensors ◽  
2020 ◽  
Vol 20 (17) ◽  
pp. 4774
Author(s):  
Chansook Lim
Keyword(s):  
Congestion Control ◽  
Transmission Control Protocol ◽  
Window Size ◽  
Preliminary Test ◽  
Transport Layer ◽  
Network Simulator ◽  
Duty Cycling ◽  
Hidden Terminal ◽  
Grid Topology ◽  
Retransmission Timeout

For smooth integration with middleboxes on the Internet, TCP (Transmission Control Protocol) is favorably considered as a transport-layer protocol for IoT (Internet of Things) networks. In constrained networks, TCP tends to perform well with a small window size. For example, the uIP (micro IP) TCP/IP stack sets the TCP window size to one segment by default. In such a case, managing the retransmission timer is a primary approach to congestion control. In this paper, we examine the congestion control mechanism of TCP in the uIP stack using grid topology networks. In the preliminary test using the Cooja network simulator, the results show that the original uIP TCP causes lots of retransmissions when a radio duty cycling mechanism such as ContikiMAC is used. One main reason is that, once retransmission is deemed to be necessary, the original uIP TCP sets the retransmission timer based on the fixed RTO (retransmission timeout) before performing a retransmission. Since ContikiMAC may cause large RTT (round-trip time) variations due to the hidden terminal problem, the retransmission timer based on the fixed RTO value may cause lots of retransmissions. To address the problem, we propose a new scheme for managing the retransmission timer which adopts the notion of weak RTT estimation of CoCoA, exponential backoffs with variable limits, and dithering. Simulation results show that our proposed scheme reduces retransmissions while enhancing throughput and fairness when an RDC (radio duty cycling) mechanism is used.

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.

scholarly journals A Model-based Scalable Reliable Multicast Transport Protocol for Satellite Networks

2017 ◽  
Vol 1 (1) ◽  
pp. 24
Author(s):  
Prawit Chumchu ◽  
Roksana Boreli ◽  
Aruna Seneviratne
Keyword(s):  
Congestion Control ◽  
Error Control ◽  
Forward Error Correction ◽  
Transmission Control Protocol ◽  
Window Size ◽  
Satellite Networks ◽  
Transport Protocol ◽  
Reliable Multicast ◽  
Auto Repeat Request ◽  
Control Part

In this paper, we design a new scalable reliable multicast transport protocol for satellite networks (RMT). This paper is the extensions of paper in [18]. The proposed protocoldoes not require inspection and/or interception of packets at intermediate nodes. The protocol would not require anymodification of satellites, which could be bent-pipe satellites or onboard processing satellites. The proposed protocol is divided in 2 parts: error control part and congestion control part. In error control part, we intend to solve feedback implosion and improve scalability by using a new hybrid of ARQ (Auto Repeat Request) and adaptive forward error correction (AFEC). The AFEC algorithm adapts proactive redundancy levels following the number of receivers and average packet loss rate. This leads to a number of transmissions and the number of feedback signals are virtually independent of the number of receivers. Therefore, wireless link utilization used by the proposed protocol is virtually independent of the number of multicast receivers. In congestion control part, the proposed protocol employs a new window-based congestion control scheme, which is optimized for satellite networks. To be fair to the other traffics, the congestion control mimics congestion control in the wellknown Transmission Control Protocol (TCP) which relies on “packet conservation” principle. To reduce feedback implosion, only a few receivers, ACKers, are selected to report the receiving status. In addition, in order to avoid “drop-to-zero” problem, we use a new simple wireless loss filter algorithm. This loss filter algorithm significantly reduces the probability of the congestion window size to be unnecessarily reduced because of common wireless losses. Furthermore, to improve achievable throughput, we employ slow start threshold adaptation based on estimated bandwidth. The congestion control also deals with variations in network conditions by dynamically electing ACKers.

Transmission Control Protocol and Active Queue Management together against congestion: cross-comparison through simulations

SIMULATION ◽  
2018 ◽  
Vol 95 (10) ◽  
pp. 979-993
Author(s):  
Carlo Augusto Grazia ◽  
Natale Patriciello ◽  
Martin Klapez ◽  
Maurizio Casoni
Keyword(s):  
Congestion Control ◽  
Transmission Control Protocol ◽  
Active Queue Management ◽  
Queue Management ◽  
Network Simulator ◽  
Transmission Control ◽  
Control Protocol ◽  
Trip Time ◽  
Multiple Round ◽  
The One

Most Internet traffic is carried by the Transmission Control Protocol (TCP) nowadays, even in the case of real-time services. Detecting and mitigating the congestion is one of the primary tasks of this protocol, in fact, different TCP versions are defined by their congestion control algorithms. Furthermore, Active Queue Management (AQM) algorithms share the same goal of congestion mitigation with TCP; in particular, the most efficient congestion control occurs when AQM and TCP work together. This paper presents a brief survey and a cross-comparison of the latest and most important TCP and AQM variants, then provides an evaluation of a different kind of performance on the ns-3 network simulator over various types of environments (multiple Round Trip Time, long delay, different congestion levels, etc.). In any shared bottleneck, the choice of the TCP-AQM couple to adopt is crucial. We will show that the results are not univocal and the “one size fits all” solution does not exist. Moreover, the proper couple depends on the performance that we want to boost and on the environment that we have to deal with.

scholarly journals Analysis of Retransmission Policies for Parallel Data Transmission

2018 ◽  
Vol 8 (3) ◽  
pp. 3079-3083
Author(s):  
I. A. Halepoto ◽  
I. H. Sadhayo ◽  
M. S. Memon ◽  
A. Manzoor ◽  
S. Bhatti
Keyword(s):  
Data Transmission ◽  
Transmission Control Protocol ◽  
Transport Layer ◽  
Transmission Protocol ◽  
Network Simulator ◽  
Parallel Transmission ◽  
Data Packets ◽  
Parallel Data ◽  
Concurrent Multipath Transfer ◽  
Multiple Paths

Stream control transmission protocol (SCTP) is a transport layer protocol, which is efficient, reliable, and connection-oriented as compared to transmission control protocol (TCP) and user datagram protocol (UDP). Additionally, SCTP has more innovative features like multihoming, multistreaming and unordered delivery. With multihoming, SCTP establishes multiple paths between a sender and receiver. However, it only uses the primary path for data transmission and the secondary path (or paths) for fault tolerance. Concurrent multipath transfer extension of SCTP (CMT-SCTP) allows a sender to transmit data in parallel over multiple paths, which increases the overall transmission throughput. Parallel data transmission is beneficial for higher data rates. Parallel transmission or connection is also good in services such as video streaming where if one connection is occupied with errors the transmission continues on alternate links. With parallel transmission, the unordered data packets arrival is very common at receiver. The receiver has to wait until the missing data packets arrive, causing performance degradation while using CMT-SCTP. In order to reduce the transmission delay at the receiver, CMT-SCTP uses intelligent retransmission polices to immediately retransmit the missing packets. The retransmission policies used by CMT-SCTP are RTX-SSTHRESH, RTX-LOSSRATE and RTX-CWND. The main objective of this paper is the performance analysis of the retransmission policies. This paper evaluates RTX-SSTHRESH, RTX-LOSSRATE and RTX-CWND. Simulations are performed on the Network Simulator 2. In the simulations with various scenarios and parameters, it is observed that the RTX-LOSSRATE is a suitable policy.

Comparative Performance Evaluation of TCP with Identical and Cross-Variant Congestion Control

2018 ◽  
Vol 8 (1) ◽  
pp. 163
Author(s):  
Nahida Nigar
Keyword(s):  
Performance Evaluation ◽  
Congestion Control ◽  
Transmission Control Protocol ◽  
Injection Rate ◽  
Transport Layer ◽  
Performance Criteria ◽  
Control Mechanisms ◽  
Comparative Performance ◽  
Rate Adaptive ◽  
Tcp Vegas

The Transmission Control Protocol (TCP), a key functional building block of the Internet, operates as a rate-adaptive end-to-end protocol at the Transport Layer of the network protocol stack. It regulates the prevailing load conditions within the network by getting the source node to adapt the packet transfer rate in accord with the processing capacity of the receiver. The regulation is enforced by means of dropping of packets on the part of the receiver. The TCP sender then reduces the packet injection rate so as to allow the network to recover from congestion. The focus of this paper is performance evaluation of certain notable TCP congestion avoidance algorithms, namely, Vegas, Reno and New Reno. Specifically, a number of performance measures have been analysed based on ns-2 simulation data where the scenarios involved TCP flows operating with identical and cross-variant congestion control mechanisms. Congestion window behaviour, packet loss, throughput, transmission delay and jitter are the performance criteria studied with the setup mentioned. In the flows with identical variants, Vegas outperforms other TCP variants. However, TCP Vegas has been observed to contribute to unfair appropriation of the resources in the cross-variant setting.

scholarly journals ECN Congestion Control Mechanism in IP Networks

1970 ◽  
Vol 8 (1-2) ◽  
pp. 12-24
Author(s):  
Subarna Shakya ◽  
Anup Sainju
Keyword(s):  
Congestion Control ◽  
Size Variation ◽  
Window Size ◽  
Ip Networks ◽  
Network Simulator ◽  
Network Resource ◽  
Advantages And Disadvantages ◽  
Wide Range ◽  
Explicit Congestion Notification ◽  
Congestion Control Mechanism

Explicit Congestion Notification (ECN) is a newer method for congestion control in TCP IP networks. Network Simulator 2 (NS2) software has been used to compare the performance of ECN packet marking to other older and newer congestion control schemes, such as DropTail and Random Early Detection (RED), in both LAN and WAN schemes. During the simulations different parameters including proportion of packet drops, window size variation, queue size, and throughput were measured to evaluate the performance. The overall objective was to independently and comparatively study ECN in a wide range of situations to better understand its advantages and disadvantages. The results of these simulations showed that when all the network prerequisites were met (i.e. all the nodes including being ECN-aware), ECN reduced packet drops and thereby optimized network resource utilization and data throughput.Key Words : Explicit Congestion Notification; Network Simulator; Random Early Detect; DropTailDOI: http://dx.doi.org/10.3126/jie.v8i1-2.5093Journal of the Institute of Engineering Vol. 8, No. 1&2, 2010/2011Page : 12-24Uploaded Date: 19 July, 2011

scholarly journals Development of an efficient mechanism for rapid protocols using NS-2 simulator

2020 ◽  
Vol 3 (1) ◽  
pp. 13-20
Author(s):  
Sarah N. Abdulwahid
Keyword(s):  
Congestion Control ◽  
High Speed ◽  
Control Algorithm ◽  
Transmission Control Protocol ◽  
Control Process ◽  
Congestion Avoidance ◽  
Network Simulator ◽  
Improvement Strategy ◽  
Slow Start ◽  
Congestion Control Algorithm

The delivered effort in this manuscript is grounded on NS-2 (The Network Simulator 2) to implement the congestion control process of classic TCP (Transmission Control Protocol), with new congestion control mechanism. In this paper, a novel congestion control algorithm is offered, which contains of slow-start and congestion avoidance mechanisms. The proposed slow-start algorithm assumes a duplicating and an interpolating approach to the congestion window (cwnd) for each increment instead of the exponential increment used by other TCP source variants such as Reno, Vega, Tahoe, Newreno, Fack, and Sack. Furthermore, the enhanced congestion avoidance algorithm is built by using an improved Additive Increase Multiplicative Decrease (AIMD) algorithm with multi TCP flow facility, to provide an enhanced congestion control algorithm with some valuable properties to improve TCP routine for high speed protocols. The improvement strategy based on merging of slow start, congestion avoidance mechanism that are used in TCP congestion control, to create a new AIMD algorithm with a new relationship between the pair parameters a and b. This paper is also involved in the creation of rapid agent in NS-2 models designed to identify the modified TCP and to configure the NS-2 platform. A fast TCP also includes an innovative scheme to slow the rapid start to help TCP to start faster through the high speed networks and also to postpone the congestion state as much as possible.

scholarly journals Performance Evaluation of TCP Vegas over TCP Reno and TCP NewReno over TCP Reno

2019 ◽  
Vol 3 (3) ◽  
Author(s):  
Tanjia Chowdhury ◽  
Mohammad Jahangir Alam
Keyword(s):  
Congestion Control ◽  
Error Detection ◽  
Transmission Control Protocol ◽  
Control Flow ◽  
Transport Layer ◽  
Control Mechanisms ◽  
Bottleneck Link ◽  
Tcp Vegas ◽  
Congestion Control Mechanism ◽  
Tcp Reno

In the Transport layer, there are two types of Internet Protocol are worked, namely- Transmission Control Protocol (TCP) and User datagram protocol (UDP). TCP provides connection oriented service and it can handle congestion control, flow control, and error detection whereas UDP does not provide any of service. TCP has several congestion control mechanisms such as TCP Reno, TCP Vegas, TCP New Reno, TCP Tahoe, etc. In this paper, we have focused on the behavior performance between TCP Reno and TCP Vegas, TCP New Reno over TCP Reno, when they share the same bottleneck link at the router. For instigating this situation, we used drop-tail and RED algorithm at the router and used NS-2 simulator for simulation. From the simulation results, we have observed that the performance of TCP Reno and TCP Vegas is different in two cases. In drop tail algorithm, TCP Reno achieves better Performance and throughput and act more an aggressive than Vegas. In Random Early Detection (RED) algorithm, both of congestion control mechanism provides better fair service when they coexist at the same link. TCP NewReno provides better performance than TCP Reno.

scholarly journals Development of an efficient mechanism for rapid protocols using NS-2 simulator

2018 ◽  
Vol 3 (1) ◽  
pp. 13-20
Author(s):  
Sarah N. Abdulwahid
Keyword(s):  
Congestion Control ◽  
High Speed ◽  
Control Algorithm ◽  
Transmission Control Protocol ◽  
Control Process ◽  
Congestion Avoidance ◽  
Network Simulator ◽  
Improvement Strategy ◽  
Slow Start ◽  
Congestion Control Algorithm

The delivered effort in this manuscript is grounded on NS-2 (The Network Simulator 2) to implement the congestion control process of classic TCP (Transmission Control Protocol), with new congestion control mechanism. In this paper, a novel congestion control algorithm is offered, which contains of slow-start and congestion avoidance mechanisms. The proposed slow-start algorithm assumes a duplicating and an interpolating approach to the congestion window (cwnd) for each increment instead of the exponential increment used by other TCP source variants such as Reno, Vega, Tahoe, Newreno, Fack, and Sack. Furthermore, the enhanced congestion avoidance algorithm is built by using an improved Additive Increase Multiplicative Decrease (AIMD) algorithm with multi TCP flow facility, to provide an enhanced congestion control algorithm with some valuable properties to improve TCP routine for high speed protocols. The improvement strategy based on merging of slow start, congestion avoidance mechanism that are used in TCP congestion control, to create a new AIMD algorithm with a new relationship between the pair parameters a and b. This paper is also involved in the creation of rapid agent in NS-2 models designed to identify the modified TCP and to configure the NS-2 platform. A fast TCP also includes an innovative scheme to slow the rapid start to help TCP to start faster through the high speed networks and also to postpone the congestion state as much as possible.

Fairness Evaluation and Comparison of Current Congestion Control Techniques.

2016 ◽  
Vol 1 (1) ◽  
pp. 176 ◽  
Author(s):  
Usman Ahmad ◽  
Md Asri Bin Ngadi ◽  
Ismail Fauzi Bin Isnin
Keyword(s):  
Congestion Control ◽  
Data Transmission ◽  
High Speed ◽  
Transmission Control Protocol ◽  
Network Simulator ◽  
Network Resources ◽  
Long Distance ◽  
Control Techniques ◽  
High Bandwidth ◽  
Tcp Reno

Transmission Control Protocol (TCP) is used by many applications on the Internet for the reliable data transmission. TCP does not able to utilize the available link bandwidth quickly and efficiently in High bandwidth short distance (HBSD) and high bandwidth long distance (HBLD) networks. Many congestion control techniques also known as TCP variants are developed to solve these problems in different network environments. In this paper an experimental analysis is done for the performance evaluation of TCP CUBIC, TCP Compound, TCP Reno and High speed TCP in term of Inter and Intra Protocol fairness by using Network Simulator 2 (NS-2). Results show that the performance of TCP CUBIC pathetically down and TCP Compound and TCP Reno shows good performance in term of protocol fairness. However, these congestion control techniques still need more improvement for the utilization of available link bandwidth in HBLD networks and other network resources.

Sign in / Sign up

Export Citation Format

Share Document