Effects of the transmission control protocol congestion-control mechanism on the self-similarity of network traffic

2007 ◽  
Vol 41 (2) ◽  
pp. 114-117 ◽  
Author(s):  
A. A. Altyeb
Keyword(s):  
Congestion Control ◽  
Network Traffic ◽  
Control Mechanism ◽  
Transmission Control Protocol ◽  
The Self ◽  
Transmission Control ◽  
Self Similarity ◽  
Control Protocol ◽  
Congestion Control Mechanism

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 Dynamic Congestion Control Mechanism in Mobile Adhoc Network: TCP Westwood-DCC

2020 ◽  
Vol 8 (5) ◽  
pp. 4784-4789
Keyword(s):  
Congestion Control ◽  
Control Mechanism ◽  
Transmission Control Protocol ◽  
Link Failure ◽  
Congestion Window ◽  
Slow Start ◽  
Mobile Adhoc Network ◽  
Adhoc Network ◽  
Tcp Westwood ◽  
Congestion Control Mechanism

Transmission control protocol faces a problem of packet loss differentiation in the wireless and mobile adhoc network. Congestion control is not properly done here. It cannot manage the congestion window as per type of loss and it reduces Congestion window unnecessarily and that degrades the performance. TCP Westwood cannot identify congestion or link failure loss, and it cannot manage the congestion window as per available bandwidth. This paper discusses that TCP Westwood performs bandwidth estimation, setting up a congestion window and a slow start threshold. In mobile adhoc network, link failure may happen frequently, and it should be handled properly. Link failure can be detected with the help of retransmission timeout. Once timeout occurs Westwood performs congestion avoidance. Proposed Westwood manages three states of congestion 1) Avoidance 2) congestion and 3) No congestion, it updates congestion window and slow start threshold as per the status of network. It maintains congestion window dynamically. Network status is identified by estimated bandwidth and proportionality ratio. Proposed method is tested on NS2.35 and compared with the existing TCP variants. The proposed Westwood performs optimized link utilization and congestion control mechanism. Hence it gives significant performance for loss recovery.

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

Sign in / Sign up

Export Citation Format

Share Document