A new active queue management algorithm based on the rate and burstiness estimation

Abstract

In this paper, we propose a new algorithm for active queue management, called ERB, which is based not only on the queue size, but also on the estimation of the rate and burstiness of the aggregate enqueueing traffic. By adjusting the packet marking probability according to these measured and estimated information in the queue management, ERB can make the router absorb the burstiness and adapt to various network conditions and traffic patterns intelligently. As a result, ERB derives the adaptability and robustness in the complex network environment. Simulation results confirm the validity of this algorithm and compare the performance of ERB, DropTail, RED and REM algorithms.