A MPTCP Congestion Control Algorithm Based on Packet Loss

2013 ◽  
Vol 401-403 ◽  
pp. 1760-1765
Author(s):  
Lan Kou ◽  
Rui Wang ◽  
Si Rui Chen

Multipath Transmission Control Protocol (MPTCP) is proposed by the IETF working group in 2009, can provide end-to-end multi-channel communication, can greatly increase the utilization of network resources and reliability. The study of the details is underway. Congestion control is one of the main issues in MPTCP study. Its goal is to ensure network throughput, to ensure the fairness of the network and to balance congestion .So this paper mainly studies congestion control algorithm. In terms of resource pooling, we propose a MPTCP congestion control algorithm based on packet loss. The algorithm can guarantee the network throughput and improve the fairness among users ,at the same time, the algorithm greatly achieve resource pooling.

Electronics ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 294
Author(s):  
Geon-Hwan Kim ◽  
Yeong-Jun Song ◽  
Imtiaz Mahmud ◽  
You-Ze Cho

The main design goals of the multipath transmission control protocol (MPTCP) are to improve the throughput and share a common bottleneck link fairly with a single-path transmission control protocol (TCP). The existing MPTCP congestion control algorithms achieve the goal of fairness with single-path TCP flows in a shared bottleneck, but they cannot maximize the throughput in nonshared bottlenecks, where multiple subflows traverse different bottleneck links. This is because the MPTCP is designed not to exceed the throughput of a single-path TCP competing in the bottleneck. Therefore, we believe that MPTCP congestion control should have different congestion window control mechanisms, depending on the bottleneck type. In this paper, we propose an adaptive decrease window (ADW) balanced linked adaptation (BALIA) congestion control algorithm that adaptively adjusts the congestion window decrease in order to achieve better throughput in nonshared bottlenecks while maintaining fairness with the single-path TCP flows in shared bottlenecks. The ADW-BALIA algorithm detects shared and nonshared bottlenecks based on delay fluctuations and it uses different congestion window decrease methods for the two types of bottleneck. When the delay fluctuations of the MPTCP subflows are similar, the ADW-BALIA algorithm behaves the same as the existing BALIA congestion control algorithm. If the delay fluctuations are dissimilar, then the ADW-BALIA algorithm adaptively modulates the congestion window reduction. We implement the ADW-BALIA algorithm in the Linux kernel and perform an emulation experiment that is based on various topologies. ADW-BALIA improves the aggregate MPTCP throughput by 20% in the nonshared bottleneck scenario, while maintaining fairness with the single-path TCP in the shared bottleneck scenario. Even in a triple bottleneck topology, where both types of bottlenecks exist together, the throughput increases significantly. We confirmed that the ADW-BALIA algorithm works stably for different delay paths, in competition with CUBIC flows, and with lossy links.


Electronics ◽  
2021 ◽  
Vol 10 (6) ◽  
pp. 711
Author(s):  
Mumajjed Ul Mudassir ◽  
M. Iram Baig

Multihomed smart gas meters are Internet of Things (IoT) devices that transmit information wirelessly to a cloud or remote database via multiple network paths. The information is utilized by the smart gas grid for accurate load forecasting and several other important tasks. With the rapid growth in such smart IoT networks and data rates, reliable transport layer protocols with efficient congestion control algorithms are required. The small Transmission Control Protocol/Internet Protocol (TCP/IP) stacks designed for IoT devices still lack efficient congestion control schemes. Multipath transmission control protocol (MPTCP) based congestion control algorithms are among the recent research topics. Many coupled and uncoupled congestion control algorithms have been proposed by researchers. The default congestion control algorithm for MPTCP is coupled congestion control by using the linked-increases algorithm (LIA). In battery powered smart meters, packet retransmissions consume extra power and low goodput results in poor system performance. In this study, we propose a modified Fast-Vegas-LIA hybrid congestion control algorithm (MFVL HCCA) for MPTCP by considering the requirements of a smart gas grid. Our novel algorithm operates in uncoupled congestion control mode as long as there is no shared bottleneck and switches to coupled congestion control mode otherwise. We have presented the details of our proposed model and compared the simulation results with the default coupled congestion control for MPTCP. Our proposed algorithm in uncoupled mode shows a decrease in packet loss up to 50% and increase in average goodput up to 30%.


Author(s):  
Fathia Ouakasse ◽  
Said Rakrak

<p class="0abstract"><span lang="EN-US">The Constrained Application Protocol (CoAP) is one of the most emerging messaging protocols that have successfully fulfilled the need of the lightweight feature required to handle communication between constrained devices in IoT environment. However, these devices are generating a huge amount of messages and notifications which cause the network congestion. Then, the challenge addressed in this paper; consists of designing a suitable congestion control mechanism for CoAP that ensures a safe network operation while keeping the use of network resources efficient. To do so, this paper presents an improved congestion control algorithm for the estimation of a Retransmission Time Out (RTO) value to use in each transaction based on the packet loss ratio and the Round-Trip Time RTT of the previous transmission. A comprehensive analysis and evaluation of simulated results show that the proposed mechanism can appropriately achieve higher performance compared to the basic CoAP congestion control and alternative algorithms based on TCP.</span></p>


2013 ◽  
Vol 462-463 ◽  
pp. 997-1000 ◽  
Author(s):  
Qiao Liu ◽  
Zheng Kun Yang ◽  
Gui Hua Duan

With the idea of binary search increasing mechanism of BIC algorithm, an improved BIC (IBIC) algorithm is proposed by adjusting the congestion window with information of packet-loss and data delay, the flow chart and some important parameters are presented, the IBIC algorithm is carried out in Linux kernel. Moreover, the Linux-based network testing platform is constructed by utilizing squid to transmit data from server to clients in gateway, and using WANem to simulate the situation of bandwidth, data dropout and delay. By testing and comparing the congestion control capability of IBIC with other main algorithms, the IBIC algorithm is proved to increase effectively the network communication efficiency.


Author(s):  
Sarah N. Abdulwahid

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.


Author(s):  
Sarah N. Abdulwahid

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.


2014 ◽  
Vol 556-562 ◽  
pp. 3995-4000
Author(s):  
Yang Tao ◽  
Peng Huang

Mobile devices equipped with multiple network interfaces can increase their throughput by making use of parallel transmissions over multiple paths and bandwidth aggregation, enabled by the multipath Transport Control Protocol (MPTCP). However, the existing MPTCP congestion control algorithm adopt a relatively strict definition of the fairness, although to some extent could ensure the fairness of traditional TCP connections, but the total throughput of MPTCP will be limited, which can not make full use of network resources. To solve this problem, this paper propose a congestion control algorithm (FBCC) based on the fairness of bottleneck. The core idea of FBCC is to set up individual fairness factor for each shared bottleneck. NS3 simulation results show that FBCC algorithm not only solves the problem of fairness, but also effectively improve the total throughput of MPTCP connection.


Author(s):  
Agus Halid ◽  
Reza Pulungan

AbstrakStream Control Transmission Protocol (SCTP) merupakan protokol yang mirip dengan Transmission Control Protocol (TCP) dan User Datagram Protocol (UDP). SCTP merupakan protokol yang bersifat reliable dan connectionless. Protokol ini memiliki kemampuan multistreaming dan multihoming dalam melakukan transmisi data. Penelitian ini merupakan pemodelan terhadap SCTP menggunakan simulator OPNET yang dapat menjadi akselerasi bagi peneliti dalam bidang jaringan. SCTP pada simulator dibangun dengan melakukan modifikasi terhadap TCP. Pemodelan dimulai dengan membangun skenario jaringan dan menentukan bandwidth pada jalur yang akan dilewati oleh paket data.Modifikasi ukuran window dalam penelitian ini menggunakan nilai 1 MMS, 2 MMS hingga 10 MMS pada pengendali kemacetan. Tujuannya adalah untuk melihat pengaruh modifikasi ukuran window terhadap nilai packet loss, delay dan throughput. Hasil pengukuran memperlihatkan bahwa nilai throughput tertinggi terdapat pada Skenario Kedua sebagaimana diperlihatkan pada Tabel 6.4 dengan nilai throughput sebesar 433.566,0244 bit/s. Penggunaan ukuran window dalam pengendali kemacetan dimaksudkan untuk menghindari banjir data pada sisi endpoint yang dapat menyebabkan packet loss. Kata kunci—Pengendali kemacetan, throughput, delay, packet loss, ukuran window, multihoming, SCTP  Abstract Stream Control Transmission Protocol (SCTP) is a protocol that is similar to the Transmission Control Protocol (TCP) and User Datagram Protocol (UDP). SCTP is a protocol that is both reliable and connectionless. This protocol has the ability multistreaming and multihoming in the transmit data.This research is the modeling of the SCTP using OPNET simulator that can be accelerated for researchers in the field of networking. SCTP on the simulator was built to perform modifications to TCP. Modeling starts with building a network scenarios and determine the bandwidth on the path that will be passed by data packets.Modification of window size in this research using 1 MMS, 2 MMS up to 10 MMS on congestion control. The aim is to disclose the effect of modification of the window size to the value packet loss, delay and throughput. The measurement results show that the throughput rate is highest in the Second Scenario as shown in Table 6.4 with throughput value of 433.566,0244 bits/s. Using window size in congestion control is intended to prevent a flood of data on the endpoint that can lead to packet loss. Keywords—Congestion control, throughput, delay, packet loss, window size, multihoming, SCTP 


2020 ◽  
Vol 23 (4) ◽  
pp. 352-356
Author(s):  
Samar Taha Yousif ◽  
Zaid Abass A. Al-Haboobi

As internet network developed rapidly in the past ten years, and its operating environment is constantly changing along with the development of computer and communication technology, the congestion problem has become more and more serious. Since TCP is the primary protocol for transport layers on the internet, the data transmitted via the transport protocol utilizes Vegas Transmission Control Protocol (TCP) as the congestion control algorithm, where it uses increasing in delay round trip time (RTT) as a signal of network congestion. However, this congestion control algorithm will attempt to fill network buffer, which causes an increase in (RTT) determined by Vegas, thereby reducing the congestion window, and making the transmission slower, Therefore Vegas has not been widely adopted on the Internet. In this paper, an improved algorithm called TCP Vegas-A is proposed consist of two parts: the first part is sending the congestion window used by the algorithm for congestion avoidance along with the TTL (Time To Live) mechanism that limits the lifetime of a packet in the network. While the second part of the algorithm is the priority-based packet sending strategy, and jitter is used as a congestion signal indication. The combination of the two is expected to improve the efficiency of congestion detection. A mathematical model is established, and the analysis of the model shows that the algorithm has better effects on controlling congestion and improving the network throughput, decreasing packet loss rate and increasing network utilization, the simulation is done using NS-2 network simulation platform environment and the results support the theoretical analysis.


Sign in / Sign up

Export Citation Format

Share Document