Stability of Primal-Dual Algorithm with Communication Delay for Congestion Control

Stability is a crucial issue for transport protocols. A lot of works study how to tune the parameters of congestion control algorithms to keep the stability of networks. This paper uses the idea of re-engineering to design an adaptive-stability congestion control algorithms base on the optimization theories. Furthermore, we present one congestion control algorithm according to different stable conditions. The effectiveness of these stability criteria is validated by simulation results．

Download Full-text

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

Sensors ◽

10.3390/s19163484 ◽

2019 ◽

Vol 19 (16) ◽

pp. 3484 ◽

Cited By ~ 1

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

Download Full-text

Adaptive Congestion Control with Time-Varying Uncertainties

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.556-562.2285 ◽

2014 ◽

Vol 556-562 ◽

pp. 2285-2288 ◽

Cited By ~ 2

Author(s):

Cun Wu Han ◽

De Hui Sun ◽

Lei Liu

Keyword(s):

Congestion Control ◽

Control Algorithm ◽

Control Algorithms ◽

Time Varying ◽

Internet Congestion Control ◽

Adaptive Technique ◽

Congestion Control Algorithm ◽

Internet Congestion ◽

Adaptive Congestion Control

Existing Internet congestion control algorithms did not consider time-varying uncertainties. This paper presents a new congestion control algorithm based on adaptive technique and robust H∞ approach, which can effectively compensate for the time-varying uncertainties. Simulation result shows that the proposed algorithm has good performance.

Download Full-text

Adaptive Fault-Tolerant Congestion Control for Internet

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.644-650.2467 ◽

2014 ◽

Vol 644-650 ◽

pp. 2467-2470

Author(s):

Lei Liu ◽

Feng Mei Zhang ◽

Cun Wu Han ◽

Song Bi ◽

De Hui Sun

Keyword(s):

Congestion Control ◽

Control Algorithm ◽

State Feedback ◽

Fault Tolerant ◽

Control Algorithms ◽

Internet Congestion Control ◽

Congestion Control Algorithm ◽

Internet Congestion

Existing Internet congestion control algorithms did not consider any faults. This paper presents a state feedback fault-tolerant congestion control algorithm which is based on adaptive and robust H∞ approaches. Simulation result shows that the proposed algorithm has good performance.

Download Full-text

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

Electronics ◽

10.3390/electronics10060711 ◽

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

Download Full-text