An Exponential Active Queue Management Method Based on Random Early Detection

Abstract EN

Congestion is a key topic in computer networks that has been studied extensively by scholars due to its direct impact on a network’s performance.

One of the extensively investigated congestion control techniques is random early detection (RED).

To sustain RED’s performance to obtain the desired results, scholars usually tune the input parameters, especially the maximum packet dropping probability, into specific value(s).

Unfortunately, setting up this parameter into these values leads to good, yet biased, performance results.

In this paper, the RED-Exponential Technique (RED_E) is proposed to deal with this issue by dropping arriving packets in an exponential manner without utilizing the maximum packet dropping probability.

Simulation tests aiming to contrast E_RED with other Active Queue Management (AQM) methods were conducted using different evaluation performance metrics including mean queue length (mql), throughput (T), average queuing delay (D), overflow packet loss probability (PL), and packet dropping probability (DP).

The reported results showed that E_RED offered a marginally higher satisfactory performance with reference to mql and D than that found in common AQM methods in cases of heavy congestion.

Moreover, RED_E compares well with the considered AQM methods with reference to the above evaluation performance measures using minimum threshold position (min threshold) at a router buffer.