Congestion Avoidance Algorithm Research Articles

Formation of Innovative Algorithm for High Speed Protocol using Network Simulator

The effort delivered in this manuscript is grounded on NS-2 (The Network Simulator 2) to implementing 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 improving TCP routine for high speed protocols.

Improving the TCP Newreno Congestion Avoidance Algorithm on 5G Networks

Enhancing Transmission Control Protocol (TCP) performance is one of the key solutions for improving the performance of modern wireless communication networks. It is a highly dependable protocol for communication between network hosts based on an internet protocol (IP). It uses packet sequence numbering and acknowledgment (ACK) packets to ensure that data is recoverable in the event of problems like data loss, and corruption. Loss-based Congestion Control (CC) algorithms overreact and underperform in the presence of rapid channel oscillations, resulting in buffer bloat and significant delays. The goal of this paper is to develop an efficient congestion control mechanism for the new TCP agent Newreno over the fifth generation (5G) network, as well as to improve the increment and decrement strategy for adjusting the congestion window (cwnd) during the congestion avoidance phase, It also fast adapts to the current network requirements and adjusts the transmission rate accordingly. TCP enhancements can improve performance under dynamic traffic loads and over long product channels with high bandwidth. As a result, when such a TCP congestion control mechanism is improved, the network’s throughput increases, and low packet losses, and delay are reduced.

A Delay-Tolerant Data Congestion Avoidance Algorithm for Enterprise Cloud System Based on Modular Computing

Traditional large-scale enterprise cloud system has the problem of large delay. Therefore, a delay tolerant data congestion avoidance algorithm based on modular computing is designed. The resource allocation rules of rbfr strategy in traditional enterprise cloud are improved to change the traditional interactive overall mode and make it modular.Using modular thinking to construct the data congestion control algorithm, mainly in the control layer to achieve the model, through the introduction of ant colony algorithm in modularization, the design of delay tolerant data congestion avoidance algorithm is realized. In order to verify the algorithm’s congestion avoidance effect, comparative experiments are designed. Experimental results show that the packet loss rate of large enterprise cloud system under this algorithm is lower than that of traditional delay tolerant data congestion avoidance algorithm.

A Framework to Maximize the Capacity of 5G Systems for Ultra-Reliable Low-Latency Communications

Providing Ultra-Reliable Low-Latency Communications (URLLC) is one of the key challenges for 5G systems, which requires the redesign of both radio access technologies and the architectures. While 3GPP and the research community focus mainly on radio low layer functionality and architectural changes that enable URLLC, this article proposes a novel cross-layer framework that extends the already standardized 5G solutions to support a very massive number of users/flows in the system. The framework consists of a scheduler, a congestion avoidance algorithm, and a new traffic management algorithm, which together achieve the maximum capacity of 5G systems for URLLC, i.e., they maximize the load at which the reliability and latency requirements are satisfied for at least 99 percent of the users. Extensive performance evaluation results demonstrate that the proposed framework achieves the network capacity very close to the upper bound.

SDCCP: Control the network using software‐defined networking and end‐to‐end congestion control

SummaryThe Internet of Things is becoming widely popular in the past decade, which comes with huge amount of data. These magnanimous data, stored in data centers, put forward the new demand for the efficient management of the network. In this article, we propose Software‐Defined Congestion Control Plane (SDCCP), a hybrid network control architecture that aims to fully utilize the network while avoiding congestion. SDCCP is based on Software‐Defined Networking and CCP, in which the controller collects the network statistics and specifies the behavior of the end‐to‐end hosts by sending feedback or modifying their transport layer parameters directly. It can also be used to mitigate Distributed Denial of Service attacks and other security problems. In addition, we propose FCA, a Feedback‐based Congestion Avoidance algorithm running on SDCCP, which adapts the congestion window based on the feedback from the remote controller. We evaluate SDCCP and FCA in Mininet and the result shows that FCA can achieve high network utilization while keeping the queue length of the routers in a low level. Also, FCA is robust to noncongestion loss, and outperforms other algorithms at high loss rate.

Development of an efficient mechanism for rapid protocols using NS-2 simulator

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.

Design and performance analysis of link-by-link congestion avoidance algorithm

In this paper, a simple but new approach, namely link-by-link congestion avoidance (LbLCA) algorithm, which works at the network layer, has been proposed. LbLCA is a proactive congestion avoidance algorithm. It uses explicit feedback to prevent congestion to happen in the first place. The novelty of LbLCA is that no per flow information is required, which makes it more scalable. Based on the design philosophy and equations, sizing of various router buffers has been arrived at for different typical network topologies. Buffer sizes depend upon the mean arrival rate at router input and outgoing link capacities and are independent of round trip time (RTT) and the number of flows passing through the router. The buffer sizes determined using LbLCA design are validated using extensive NS2 simulations. The performance evaluation has been done using NS2 simulations on the typical network topologies. The performance comparison between TCP and LbLCA reveals that proposed LbLCA algorithm gives improved performance for the end-to-end delay and packet delivery ratio. LbLCA is impartial to all flows, as LbLCA works at network layer and therefore, cannot differentiate between flows.

Design and Performance Analysis of Link-by-Link Congestion Avoidance (LbLCA) Algorithm

In this paper, a simple but new approach, namely link-by-link congestion avoidance (LbLCA) algorithm, which works at the network layer, has been proposed. LbLCA is a proactive congestion avoidance algorithm. It uses explicit feedback to prevent congestion to happen in the first place. The novelty of LbLCA is that no per flow information is required, which makes it more scalable. Based on the design philosophy and equations, sizing of various router buffers has been arrived at for different typical network topologies. Buffer sizes depend upon the mean arrival rate at router input and outgoing link capacities and are independent of round trip time (RTT) and the number of flows passing through the router. The buffer sizes determined using LbLCA design are validated using extensive NS2 simulations. The performance evaluation has been done using NS2 simulations on the typical network topologies. The performance comparison between TCP and LbLCA reveals that proposed LbLCA algorithm gives improved performance for the end-to-end delay and packet delivery ratio. LbLCA is impartial to all flows, as LbLCA works at network layer and therefore, cannot differentiate between flows.

Improvement Ivestigation of the TCP Algorithms With Avoiding Network Congestion Based on OPNET

The aim of this paper is to determine the performance enhancement of the network for eliminating congestion through the use of the benefits of algorithms. These algorithms can be used in hindering the congestion which may occur within the network that relies on a Transmission Control Protocol (TCP) protocol. This paper specifically focuses on demonstrating the function of TCP, and most especially the four (slow start, congestion avoidance, fast retransmit and fast recovery algorithms) that are applied in the control of congestion. In the study, the varying effects of connection link from PPP DS1 to PPP DS3 on the network’s performance are investigated.

A Novel Congestion Avoidance Algorithm for Autonomous Vehicles Assessed by Queue Modeling

Autonomous vehicle (AV) fleet management is one of the major aspects of AV development that needs to be standardized before AV deployment. There has been no consensus on whether AV deployment in general will be beneficial or detrimental in terms of road congestion. There are similarities between packet transmission in computer networks and AV transportation in road networks. In this work, the authors argue that congestion avoidance algorithms used in computer networks can be applied for AV fleet management. Authors modify and evaluate a novel adaptation of additive increase and multiplicative decrease (AMID) congestion avoidance algorithm. The authors propose assigning different priorities to transportation tasks in order to facilitate sharing the limited resources in such as usage of the road network. This will be modeled and assessed using a queueing model based on AVs arrival distribution. This will result in a load balancing paradigm that can be used to share and manage limited resources. Then, by using numerical study authors merge congestion avoidance and load balancing to analyze the authors' scheme in term of road network throughput (number of cars in network for a given time) for AV fleet management. Their evaluation demonstrates the improvement in terms of road network throughput.

Fast congestion-free consistent flow forwarding rules update in software defined networking

In software defined networking (SDN), flow migration will be required when topology changes to improve network performance such as load balancing. However, black holes, loops and transient congestion may occur during flow migration due to the asynchronous update of switches on the data plane. Therefore, in this paper, we propose a novel segmented update method to shorten the time of rules update, and a novel transient congestion avoidance algorithm to minimize the number of delayed updating flows, which can both reduce update time of flows. Specifically, we construct three novel models to guarantee no black holes, no loops and no transient congestion, respectively. The first two models to avoid black holes and loops can update multiple nodes in each segment instead of updating the nodes one by one like Cupid. The third model to avoid transient congestion minimizes the number of delayed updating flows. Subsequently, three novel black holes avoidance algorithm, loops avoidance algorithm and congestion avoidance algorithm are respectively proposed. Furthermore, we propose a novel rules update (RU) algorithm which combines these three algorithms to update the rules to avoid black holes, loops and transient congestion simultaneously. Simulation results show that our scheme can increase the number of directly updated flows by 75% on a single congestion link and reduce the rules update time of the flows by 34% compared with the existing work.

Development of an efficient mechanism for rapid protocols using NS-2 simulator

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.

Comparative Performance Evaluation of TCP with Identical and Cross-Variant Congestion Control

The Transmission Control Protocol (TCP), a key functional building block of the Internet, operates as a rate-adaptive end-to-end protocol at the Transport Layer of the network protocol stack. It regulates the prevailing load conditions within the network by getting the source node to adapt the packet transfer rate in accord with the processing capacity of the receiver. The regulation is enforced by means of dropping of packets on the part of the receiver. The TCP sender then reduces the packet injection rate so as to allow the network to recover from congestion. The focus of this paper is performance evaluation of certain notable TCP congestion avoidance algorithms, namely, Vegas, Reno and New Reno. Specifically, a number of performance measures have been analysed based on ns-2 simulation data where the scenarios involved TCP flows operating with identical and cross-variant congestion control mechanisms. Congestion window behaviour, packet loss, throughput, transmission delay and jitter are the performance criteria studied with the setup mentioned. In the flows with identical variants, Vegas outperforms other TCP variants. However, TCP Vegas has been observed to contribute to unfair appropriation of the resources in the cross-variant setting.

Performance analysis of WMNs by WMN-GA simulation system for two WMN architectures and different TCP congestion-avoidance algorithms and client distributions

Performance analysis of WMNs by WMN-GA simulation system for two WMN architectures and different TCP congestion-avoidance algorithms and client distributions

Performance analysis of WMNs by WMN-GA simulation system for two WMN architectures and different TCP congestion-avoidance algorithms and client distributions

In this paper, we evaluate the performance of two wireless mesh networks (WMNs) architectures considering packet delivery ratio (PDR), throughput, delay and fairness index metrics. For simulations, we used ns-3, distributed coordination function (DCF) and optimised link state routing (OLSR). We compare the performance of transmission control protocol (TCP) Tahoe, Reno and NewReno for normal and uniform distributions of mesh clients by sending multiple constant bit rate (CBR) flows in the network. The simulation results show that the PDR for both distributions and architectures is almost the same, but the PDR of I/B WMN for uniform distribution is a little bit higher than normal distribution. For both WMN architectures, the throughput of normal distribution is better than uniform distribution. The delay of Tahoe is a little bit lower compared with other algorithms for normal distribution and Hybrid WMN, but in case of uniform distribution, the NewReno performs better than other algorithms for both architectures. The fairness index of normal distribution is higher than uniform distribution.

Water Wave Optimization Algorithm based Congestion Control and Quality of Service Improvement in Wireless Sensor Networks

Many researchers have implemented various machine learning algorithms and verify their results with the existing algorithms to control congestion in Wireless Sensor Networks. The major challenge lies in developing an algorithm which optimizes the value of the objective function on the basis of parameters like network throughput, residual energy and packet loss rate of the nodes in the network. An objective function based on these parameters is proposed in the present work. Water wave optimization algorithm is applied on the objective function and an optimum solution is obtained. The proposed approach is compared with the Congestion Detection and Avoidance algorithm (CODA) and Particle Swarm Optimization Algorithm (PSO). The proposed solution outperforms both algorithms on the basis of various performance parameters.

Congestion avoidance algorithm using ARIMA(2,1,1) model-based RTT estimation and RSS in heterogeneous wired-wireless networks

In the past two decades, there has been a fast growth in the heterogeneous wired-wireless network which connects variety of networks such as wired network, wireless network, high speed network and sensor network with the Internet. Since the wired network and wireless network use the different technologies, there is a necessity of developing new protocols or redesigning of existing protocols. Transmission Control Protocol is redesigned to achieve the reliable and effective communication in the heterogeneous wired-wireless network. The basic assumption made in Transmission Control Protocol is that the packet losses are caused by the network congestion but in case of wireless network, the packet losses may be due to temporary link failure, high Bit-Error-Rate etc. Hence the congestion avoidance algorithm of Transmission Control Protocol needs to be redesigned to cope with heterogeneous wired-wireless network. Therefore in this paper, we propose a congestion avoidance algorithm which differentiates the cause of packet losses. The essential components of proposed algorithm are round-trip-time estimation, backlogged packet estimation, channel status notification, loss differentiation algorithm and congestion window control. A round-trip-time estimation using ARIMA(2,1,1) model is proposed in this paper which estimates the sudden changes in the round trip time. It helps us to estimate the backlogged packet and thereby differentiating the congestive packet loss from non-congestive packet loss. In addition, we use the received signal strength of wireless receiver to differentiate the packet losses. Based on the packet loss differentiation, the congestion window size is controlled to avoid the congestion in the network. The proposed algorithm is simulated using network simulator under different network environments. From the simulation results, it is realized that the proposed congestion avoidance algorithm performs well in the heterogeneous wired-wireless network.

Performance analysis of different architectures and TCP congestion-avoidance algorithms using WMN-GA simulation system

In this paper, we evaluate the performance of two Wireless Mesh Networks (WMNs) architectures considering throughput, delay, jitter and fairness index metrics. For simulations, we used ns-3, Distributed Coordination Function (DCF) and Optimized Link State Routing (OLSR). We compare the performance of WMN for different Transmission Control Protocol (TCP): Tahoe, Reno and NewReno considering normal and uniform distributions of mesh clients by sending multiple Constant Bit Rate (CBR) flows in the network. The simulation results show that for normal and uniform distributions and both WMN architectures, the PDR values are almost the same. For Hybrid WMN, the throughput of TCP NewReno is good, but for I/B WMN, the throughput of TCP Tahoe is higher than other algorithms. For normal distribution, the delay and jitter of I/B WMN are lower compared with Hybrid WMN, while for uniform distribution, the delay and jitter of TCP NewReno are a little bit lower compared with other algorithms. The fairness index of normal distribution is higher than uniform distribution.

Enhanced low latency queuing algorithm with active queue management for multimedia applications in wireless networks

Low cost broadband services used widely in the recent years increased the demand for multimedia applications. Many of these applications require different quality of service (QoS) in terms of throughput and delay. In the current resource constrained wireless networks, resource management plays a vital role. In order to handle the resources effectively and to increase the QoS, proper packet scheduling algorithms need to be developed. Low latency queuing (LLQ) is a packet scheduling algorithm which combines strict priority queuing (SPQ) to class-based weighted fair queuing (CBWFQ). In this paper, an enhanced low latency queuing (ELLQ) algorithm is proposed in which an additional SPQ is introduced along with the existing SPQ. Further, the QoS is improved by integrating congestion avoidance algorithm with ELLQ. Simulation results using the OPNET modeller show that the proposed algorithm outperforms the existing algorithm in terms of throughput and delay for the multimedia applications.

Enhanced low latency queuing algorithm with active queue management for multimedia applications in wireless networks

Low cost broadband services used widely in the recent years increased the demand for multimedia applications. Many of these applications require different quality of service (QoS) in terms of throughput and delay. In the current resource constrained wireless networks, resource management plays a vital role. In order to handle the resources effectively and to increase the QoS, proper packet scheduling algorithms need to be developed. Low latency queuing (LLQ) is a packet scheduling algorithm which combines strict priority queuing (SPQ) to class-based weighted fair queuing (CBWFQ). In this paper, an enhanced low latency queuing (ELLQ) algorithm is proposed in which an additional SPQ is introduced along with the existing SPQ. Further, the QoS is improved by integrating congestion avoidance algorithm with ELLQ. Simulation results using the OPNET modeller show that the proposed algorithm outperforms the existing algorithm in terms of throughput and delay for the multimedia applications.