an improvement over random early detection algorithm: a self-tuning approach

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 values is not an efficient solution. we propose a new method to dynamically tuning red’s parameters. for this purpose, we compute the rate of which the queue is occupied and consider it as a congestion metric that will be forecasted  when the queue is overloaded. this meter is used to dynamically setting red parameters. the simulation results show the effectiveness of the proposed method. according to the results, we achieve a significantly higher utilization and less packet loss comparing to original red algorithm in dynamic conditions of the network.