BO-ARED: A new AQM algorithm with adaptive adjustment of parameters
Yunqi Luo, Hong Chen, Xiaoping Yang, Yuxiang Hao · 2010
To address the problems of network congestion, Active queue management (AQM) is advocated to improve the quality of services (QoS) for Internet. Random early detective (RED) algorithm is one of notably AQM mechanism, because it could reduce the high drop rate of bursty flows, avoid global synchronization among flows and reduces network latency (“ping time”). However, RED requires careful tuning of its parameters in order to provide good performance. For solving this problem, this paper proposes a new mechanism to improve RED algorithm, which is named BO-ARED (An Adaptive RED Algorithm Combined With Buffer Occupation). By matching router's buffer occupation with wq, minth, maxthand Pmaxparameter settings, to make BO-ARED adapt to network environment variation automatically. The simulations take comparisons of the BO-ARED with RED, ARED and BORED. It is shown in the simulation results that BO-ARED algorithm maintains the great performance while network environment varies. It has low drop rate, low average delay time and high throughput with it adaptive parameters.