scholarly journals MFVL HCCA: A Modified Fast-Vegas-LIA Hybrid Congestion Control Algorithm for MPTCP Traffic Flows in Multihomed Smart Gas IoT Networks

Electronics ◽  
2021 ◽  
Vol 10 (6) ◽  
pp. 711
Author(s):  
Mumajjed Ul Mudassir ◽  
M. Iram Baig
Keyword(s):  
Congestion Control ◽  
Control Algorithm ◽  
Transmission Control Protocol ◽  
Transport Layer ◽  
Control Mode ◽  
Control Algorithms ◽  
Transmission Control ◽  
Control Protocol ◽  
Congestion Control Algorithm ◽  
Iot Devices

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%.

scholarly journals Adaptive Decrease Window for BALIA (ADW-BALIA): Congestion Control Algorithm for Throughput Improvement in Nonshared Bottlenecks

Electronics ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 294
Author(s):  
Geon-Hwan Kim ◽  
Yeong-Jun Song ◽  
Imtiaz Mahmud ◽  
You-Ze Cho
Keyword(s):  
Congestion Control ◽  
Control Algorithm ◽  
Transmission Control Protocol ◽  
Control Mechanisms ◽  
Congestion Window ◽  
Transmission Control ◽  
Control Protocol ◽  
Congestion Control Algorithm ◽  
Lossy Links ◽  
Single Path

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.

Wireless Transport Layer Congestion Control Evaluation

2011 ◽  
Vol 1 (3) ◽  
pp. 71-81 ◽  
Author(s):  
Sanjay P. Ahuja ◽  
W. Russell Shore
Keyword(s):  
Congestion Control ◽  
Control Algorithm ◽  
Transport Layer ◽  
Network Congestion ◽  
Test Bed ◽  
Control Protocol ◽  
Congestion Control Algorithm ◽  
Transport Control ◽  
Wireless Transport ◽  
Control Evaluation

The performance of transport layer protocols can be affected differently due to wireless congestion, as opposed to network congestion. Using an active network evaluation strategy in a real world test-bed experiment, the Transport Control Protocol (TCP), Datagram Congestion Control Protocol (DCCP), and Stream Control Transport Protocol (SCTP) were evaluated to determine their effectiveness in terms of throughput, fairness, and smoothness. Though TCP’s fairness was shown to suffer in wireless congestion, the results showed that it still outperforms the alternative protocols in both wireless congestion, and network congestion. In terms of smoothness, the TCP-like congestion control algorithm of DCCP did outperform TCP in wireless congestion, but at the expense of throughput and ensuing fairness. SCTP’s congestion control algorithm was also found to provide better smoothness in wireless congestion. In fact, it provided smoother throughput performance than in the network congestion.

Wireless Transport Layer Congestion Control Evaluation

2013 ◽  
pp. 241-250
Author(s):  
Sanjay P. Ahuja ◽  
W. Russell Shore
Keyword(s):  
Congestion Control ◽  
Control Algorithm ◽  
Transport Layer ◽  
Network Congestion ◽  
Test Bed ◽  
Control Protocol ◽  
Congestion Control Algorithm ◽  
Transport Control ◽  
Stream Control ◽  
Control Evaluation

The performance of transport layer protocols can be affected differently due to wireless congestion, as opposed to network congestion. Using an active network evaluation strategy in a real world test-bed experiment, the Transport Control Protocol (TCP), Datagram Congestion Control Protocol (DCCP), and Stream Control Transport Protocol (SCTP) were evaluated to determine their effectiveness in terms of throughput, fairness, and smoothness. Though TCP’s fairness was shown to suffer in wireless congestion, the results showed that it still outperforms the alternative protocols in both wireless congestion, and network congestion. In terms of smoothness, the TCP-like congestion control algorithm of DCCP did outperform TCP in wireless congestion, but at the expense of throughput and ensuing fairness. SCTP’s congestion control algorithm was also found to provide better smoothness in wireless congestion. In fact, it provided smoother throughput performance than in the network congestion.

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
Keyword(s):  
Congestion Control ◽  
Packet Loss ◽  
Working Group ◽  
Control Algorithm ◽  
Transmission Control Protocol ◽  
Network Throughput ◽  
Network Resources ◽  
Transmission Control ◽  
Resource Pooling ◽  
Congestion Control Algorithm

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.

Random Early Discard (RED) Queue Evaluation for Congestion Control

2012 ◽  
pp. 229-246
Author(s):  
Md. Shohidul Islam ◽  
Md. Niaz Morshed ◽  
Sk. Shariful Islam ◽  
Md. Mejbahul Azam
Keyword(s):  
Congestion Control ◽  
Performance Optimization ◽  
Transmission Control Protocol ◽  
Active Queue Management ◽  
Queue Management ◽  
Transmission Control ◽  
Control Protocol ◽  
Network Parameters ◽  
Internet Performance ◽  
And Control

Congestion is an un-avoiding issue of networking, and many attempts and mechanisms have been devised to avoid and control congestion in diverse ways. Random Early Discard (RED) is one of such type of algorithm that applies the techniques of Active Queue Management (AQM) to prevent and control congestion and to provide a range of Internet performance facilities. In this chapter, performance of RED algorithm has been measured from different point of views. RED works with Transmission Control Protocol (TCP), and since TCP has several variants, the authors investigated which versions of TCP behave well with RED in terms of few network parameters. Also, performance of RED has been compared with its counterpart Drop Tail algorithm. These statistics are immensely necessary to select the best protocol for Internet performance optimization.

scholarly journals A Contention-Based Hop-By-Hop Bidirectional Congestion Control Algorithm for Ad-Hoc Networks

Sensors ◽  
2019 ◽  
Vol 19 (16) ◽  
pp. 3484 ◽  
Author(s):  
Jiashuai Wang ◽  
Xiaoping Yang ◽  
Ying Liu ◽  
Zhihong Qian
Keyword(s):  
Congestion Control ◽  
Queue Length ◽  
Control Algorithm ◽  
Ad Hoc ◽  
Control Algorithms ◽  
Distributed Coordination ◽  
Current Node ◽  
Congestion Control Algorithm ◽  
Hoc Networks ◽  
Coordination Function

Existing hop-by-hop congestion control algorithms are mainly divided into two categories: those improving the sending rate and those suppressing the receiving rate. However, these congestion control algorithms have problems with validity and limitations. It is likely that the network will be paralyzed due to the unreasonable method of mitigating congestion. In this paper, we present a contention-based hop-by-hop bidirectional congestion control algorithm (HBCC). This algorithm uses the congestion detection method with queue length as a parameter. By detecting the queue length of the current node and the next hop node, the congestion conditions can be divided into the following four categories: 0–0, 0–1, 1–0, 1–1 (0 means no congestion, 1 means congestion). When at least one of the two nodes is congested, the HBCC algorithm adaptively adjusts the contention window of the current node, which can change the priority of the current node to access the channel. In this way, the buffer queue length of the congested node is reduced. When the congestion condition is 1–1, the hop-by-hop priority congestion control (HPCC) method proposed in this paper is used. This algorithm adaptively changes the adjustment degree of the current node competition window and improves the priority of congestion processing of the next hop node. The NS2 simulation shows that by using the HBCC algorithm, when compared with distributed coordination function (DCF) without congestion control, the proposed unidirectional congestion control algorithms hop-by-hop receiving-based congestion control (HRCC) and hop-by-hop sending-based congestion control (HSCC), and the existing congestion control algorithm congestion alleviation—MAC (CA-MAC), the average saturation throughput increased by approximately 90%, 62%, 12%, and 62%, respectively, and the buffer overflow loss ratio reduced by approximately 80%, 79%, 44%, and 79%.

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.

Sign in / Sign up

Export Citation Format

Share Document