Rate-based Congestion Control Algorithm Research Articles

Energy efficient optimized rate based congestion control routing in wireless sensor network

A wireless sensor network is designed to facilitate various real time applications, constituting a wide range of sensor nodes. In order to provide energy efficient transmissions, a novel congestion control mechanism is proposed on optimized rate. Here, the rate-based congestion control algorithm based on cluster routing is introduced to reduce energy consumption throughout the network. Rate control process reduces the end to end delay to improve network life time for large simulation period. Initially, nodes are clustered by the hybrid K-means and Greedy best first search algorithms. After that, the rate control is performed using firefly optimization strategy which is suitable for high packet delivery ratio. Finally, packets are sent with maximum throughput using Ant Colony Optimization-based routing. The simulation is performed on the MATLAB simulation platform. Finally, performances are evaluated with respect to, average delay in end to end node, delivery ratio of packets, throughput, energy efficiency, energy consumption and reliability.

Analysis of Rate Based Congestion Control Algorithms in Wireless Technologies

In this paper, the congestion control algorithms in wireless technolologies are analysed. It has been found that TCP VEGAS is better than other TCP variants for sending data and information due to better delivery fraction and average end to end delay. But it has a consistent window size for packet transmission. Congestion Avoidance can resolve Congestion effectively and has higher average throughput than slow start due to the ability to deal with random loss. Cross layer Congestion Control require significant power and memory corresponding to network bandwidth. So to overcome all these problems, here we analyse the performance of AIMD, TFRC and TCP congestion control protocol. After observing simulation results, it is found that GAIMD is better than TFRC in terms of throughput and TFRC is better than GAIMD in terms of smoothness.

End-to-end rate-based congestion control with random loss: convergence and stability

The convergence and stability analysis for two end-to-end rate-based congestion control algorithms with unavoidable random loss in packets are presented, which can be caused by, for example, errors on wireless links. The convergence rates of these two algorithms are analyzed by linearizing them around their equilibrium points, since they are globally stable and can converge to their unique equilibrium points. Some sufficient conditions for local stability in the presence of round-trip delay are obtained based on the general Nyquist criterion of stability. The stability conditions can be considered to be more general. If random loss in the first congestion control algorithm is not considered, they reduce to the local stability conditions which have been obtained in some literatures. Furthermore, sufficient conditions for local stability of a new congestion control algorithm have also been obtained if random loss is not considered in the second congestion control algorithm.

Media- and TCP-friendly congestion control for scalable video streams

This paper presents a media- and TCP-friendly rate-based congestion control algorithm (MTFRCC) for scalable video streaming in the Internet. The algorithm integrates two new techniques: i) a utility-based model using the rate-distortion function as the application utility measure for optimizing the overall video quality; and ii) a two-timescale approach of rate averages (long-term and short-term) to satisfy both media and TCP-friendliness. We evaluate our algorithm through simulation and compare the results against the TCP-friendly rate control (TFRC) algorithm. For assessment, we consider five criteria: TCP fairness, responsiveness, aggressiveness, overall video quality, and smoothness of the resulting bit rate. Our simulation results manifest that MTFRCC performs better than TFRC for various congestion levels, including an improvement of the overall video quality.

Design and evaluation of an efficient traffic control scheme for integrated voice, video, and data over asynchronous transfer mode networks: Explicit allowed rate algorithm

Asychronous transfer mode (ATM) networks are high-speed networks with guaranteed quality of service. The main cause of congestion in ATM networks is over utilization of physical bandwidth. Unlike constant bit-rate (CBR) traffic, the bandwidth reserved by variable bit-rate (VBR) traffic is not fully utilized at all instances. Hence, this unused bandwidth is allocated to available bit-rate (ABR) traffic. As the bandwidth used by VBR traffic changes, available bandwidth for ABR traffic varies; i.e., available bandwidth for ABR traffic is inversely proportional to the bandwidth used by the VBR traffic. Based on this fact, a rate-based congestion control algorithm, Explicit Allowed Rate Algorithm (EARA), is presented in this paper. EARA is compared with Proportional Rate Control Algorithm (PRCA) and Explicit Rate Indication Congestion Avoidance Algorithm (ERICA), in both LAN and WAN environments. Simulations of all three algorithms are conducted under both congestion and fairness configurations with simultaneous generation of CBR, rt-VBR, nrt-VBR and ABR traffic. The results show that, with very small over-head on the switch, EARA significantly decreases the required buffer space and improves the network throughput. Copyright © 1999 John Wiley & Sons, Ltd.

Parameter tuning of rate-based congestion control algorithm for ABR service class in ATM networks

A rate-based congestion control algorithm has been developed and standardized in the ATM forum for ABR service class. In the standard the behaviour of source and destination end systems is specified by several control parameters such as RIF (rate increase factor) and RDF (rate decrease factor). In spite of the fact that the performance of the rate-based congestion control algorithm depends heavily on the selection of these control parameters, no selection method of parameters is shown in the standard. In this paper, by extending our previous work, appropriate settings of rate-control parameters in the various circumstances are investigated. We first analyse the dynamical behaviour of the rate-based congestion control for multiple groups of ABR connections with different propagation delays. Next we evaluate the effect of CBR traffic on ABR connections. Simulation results for a multihop network configuration are also presented to exhibit the trade-off relationship among cell loss probability, link utilization and fairness. Finally, a selection method of control parameters in the multihop network is proposed based on our analytic methods and simulation results © 1998 John Wiley & Sons, Ltd.

Parameter tuning of rate‐based congestion control algorithm for ABR service class in ATM networks

A rate-based congestion control algorithm has been developed and standardized in the ATM forum for ABR service class. In the standard the behaviour of source and destination end systems is specified by several control parameters such as RIF (rate increase factor) and RDF (rate decrease factor). In spite of the fact that the performance of the rate-based congestion control algorithm depends heavily on the selection of these control parameters, no selection method of parameters is shown in the standard. In this paper, by extending our previous work, appropriate settings of rate-control parameters in the various circumstances are investigated. We first analyse the dynamical behaviour of the rate-based congestion control for multiple groups of ABR connections with different propagation delays. Next we evaluate the effect of CBR traffic on ABR connections. Simulation results for a multihop network configuration are also presented to exhibit the trade-off relationship among cell loss probability, link utilization and fairness. Finally, a selection method of control parameters in the multihop network is proposed based on our analytic methods and simulation results © 1998 John Wiley & Sons, Ltd.

Rate-based congestion control for ATM networks

Congestion control plays an important role in the effective and stable operation of ATM networks. This paper first gives a historical overview of rate-based congestion control algorithms developed in the ATM Forum, showing how the current ATM Forum standard regarding the traffic management control methods is exploited, by these algorithm. Then, analytical approach is used to quantitatively evaluate their performance and show the effectiveness of the rate-based approach. In presenting the numerical examples, we emphasize that appropriate control parameter settings are essential for proper traffic management in an ATM network environment.