scholarly journals Self-Tuning Random Early Detection Algorithm to Improve Performance of Network Transmission

2011 ◽  
Vol 2011 ◽  
pp. 1-17 ◽  
Author(s):  
Jianyong Chen ◽  
Cunying Hu ◽  
Zhen Ji

We use a discrete-time dynamical feedback system model of TCP/RED to study the performance of Random Early Detection (RED) for different values of control parameters. Our analysis shows that the queue length is able to keep stable at a given target if the maximum probabilitypmax⁡and exponential averaging weightwsatisfy some conditions. From the mathematical analysis, a new self-tuning RED is proposed to improve the performance of TCP-RED network. The appropriatepmax⁡is dynamically obtained according to history information of bothpmax⁡and the average queue size in a period of time. Andwis properly chosen according to a linear stability condition of the average queue length. From simulations withns-2, it is found that the self-tuning RED is more robust to stabilize queue length in terms of less deviation from the target and smaller fluctuation amplitude, compared to adaptive RED, Random Early Marking (REM), and Proportional-Integral (PI) controller.

2010 ◽  
Vol 2010 ◽  
pp. 1-14 ◽  
Author(s):  
Jianyong Chen ◽  
Cunying Hu ◽  
Zhen Ji

In order to achieve high throughput and low average delay in computer network, it is necessary to stabilize the queue length and avoid oscillation or chaos phenomenon. In this paper, based on Adaptive Random Early Detection (ARED), an improved algorithm is proposed, which dynamically changes the range of maximum drop probabilitypmaxaccording to different network scenarios and adjustspmaxto limit average queue sizeqavein a steady range. Moreover, exponential averaging weightwis adjusted based on linear stability condition to stabilizeqave. A number of simulations show that the improved ARED algorithm can effectively stabilize the queue length and perform better than other algorithms in terms of stability and chaos control.


2010 ◽  
Vol 20 (05) ◽  
pp. 1415-1437 ◽  
Author(s):  
CHARLOTTE YUK-FAN HO ◽  
BINGO WING-KUEN LING ◽  
HERBERT H. C. IU

In this paper, a symbolic dynamical model of the average queue size of the random early detection (RED) algorithm is proposed. The conditions for 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 conditions so that internet networks can achieve a good performance.


Author(s):  
Muntadher Abdulkareem ◽  
Kassem Akil ◽  
Ali Kalakech ◽  
Seifedine Kadry

Sign in / Sign up

Export Citation Format

Share Document