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.

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

scholarly journals Improved RTT Fairness of BBR Congestion Control Algorithm Based on Adaptive Congestion Window

Electronics ◽  
2021 ◽  
Vol 10 (5) ◽  
pp. 615
Author(s):  
Wansu Pan ◽  
Haibo Tan ◽  
Xiru Li ◽  
Xiaofeng Li
Keyword(s):  
Congestion Control ◽  
Control Algorithm ◽  
Delivery Rate ◽  
Propagation Time ◽  
Network Simulator ◽  
Round Trip ◽  
Congestion Window ◽  
Queuing Delay ◽  
Congestion Control Algorithm ◽  
Tcp Congestion Control

To alleviate the lower performance of Transmission Control Protocol (TCP) congestion control over complex network, especially the high latency and packet loss scenario, Google proposed the Bottleneck Bandwidth and Round-trip propagation time (BBR) congestion control algorithm. In contrast with other TCP congestion control algorithms, BBR adjusted transfer data by maximizing delivery rate and minimizing delay. However, some evaluation experiments have shown that the persistent queues formation and retransmissions in the bottleneck can lead to serious fairness issues between BBR flows with different round-trip times (RTTs). They pointed out that small RTT differences cause unfairness in the throughput of BBR flows and flows with longer RTT can obtain higher bandwidth when competing with the shorter RTT flows. In order to solve this fairness problem, an adaptive congestion window of BBR is proposed, which adjusts the congestion window gain of each BBR flow in network load. The proposed algorithms alleviate the RTT fairness issue by controlling the upper limit of congestion window according to the delivery rate and queue status. In the Network Simulator 3 (NS3) simulation experiment, it shows that the adaptive congestion window of BBR (BBR-ACW) congestion control algorithm improves the fairness by more than 50% and reduces the queuing delay by 54%, compared with that of the original BBR in different buffer sizes.

scholarly journals CONGESTION CONTROL ALGORITHM FOR MESSAGE ROUTING IN STRUCTURED PEER-TO-PEER NETWORKS

2018 ◽  
Vol 34 (2) ◽  
pp. 145-159
Author(s):  
Nguyễn Đình Nghĩa ◽  
Nguyễn Hoài Sơn
Keyword(s):  
Congestion Control ◽  
Control Algorithm ◽  
Control Process ◽  
Peer To Peer ◽  
P2p Networks ◽  
Message Routing ◽  
Retrieval Systems ◽  
Peer To Peer Networks ◽  
Congestion Control Algorithm ◽  
Information Retrieval Systems

Many complex applications have been built on the basis of structured peer-to-peer (P2P) networks such as information retrieval systems, file sharing systems, and so on. These applications often have to process a large number of queries quickly and efficiently. When the number of queries to a node exceeds its capacity, a local bottleneck occurs and reduces the information processing of the other nodes in the network. This paper proposes a congestion control algorithm for message routing in structured P2P networks by changing the routing table of nodes in the network to route the packet to the destination without going through the congested node. The performance of proposed method has been evaluated and compared with the conventional Chord protocol. The result shows that our proposed method improves the query success rate significantly while minimizing the number of packets generated during congestion control process

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.

Sign in / Sign up

Export Citation Format

Share Document