random early detection (red) is one of the most commonly used active queue management (aqm) algorithms that is recommended by ietf for deployment in the network. although red provides low average queuing delay and high throughput at the same time, but effectiveness of red is highly sensitive to the red parameters setting. as network condition varies largely, setting red's parameters with fixed ...

RED (Random Early Detection) routers can provide better fairness among many competing TCP connections than TD (Tail-Drop) routers, but it is true only when the control parameters of RED are set appropriately according to the network congestion status. However, it is very difficult because the network condition varies largely, especially when the number of accommodated connections is large. In t...

The Random Early Detection algorithm is considered as a promising algorithm for Differentiated Services to cope with feedback oriented traffic like TCP. In this paper, we model the salient features of TCP and RED and evaluate the model using a discrete-time analysis. The novelty of our investigation is the analytic approach to the composed model, i.e., TCP feedback traffic over a RED queue. Der...

Random Early Detection (RED) is one of the most commonly used Active Queue Management (AQM) algorithms that is recommended by IETF for deployment in the network. Although RED provides low average queuing delay and high throughput at the same time, but effectiveness of RED is highly sensitive to the RED parameters setting. As network condition varies largely, setting RED's parameters with fixed ...

active queue management (aqm) plays an important role in the internet congestion control. it tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. random early detection (red) is the most popular active queue management algorithm that has been implemented in the in internet routers and is trying to supply low delay and low packet loss. red algori...

In this paper, we present a mechanism called DWRED (Dynamic Weighted RED) that uses communicating agents in a Multi-Agents Systems to enhance the Random Early Detection (RED) congestion management algorithm, by providing service for multiple classes of traffic as well as cooperation between the network nodes to dynamically modify the running algorithm’s parameters in response to network congest...

Random Early Detection (RED) is the recommended active queue management scheme for rapid deployment throughout the Internet. As a result, there have been considerable research efforts in studying the performance of RED. However, previous studies have often focused on relatively homogeneous environment. The effects of RED in a heterogeneous environment are not thoroughly understood. In this pape...

In this paper, a symbolic dynamical model of the average queue size of the random early detection (RED) algorithm is proposed. The conditions on both the system parameters and the initial conditions that the average queue size of the RED algorithm would converge to a fixed point are derived. These results are useful for network engineers to design both the system parameters and the initial cond...