Etude de la configuration dynamique des paramètres de RED

Abstract

Our workfocuses on an adaptive approach of RED that does not require any hypothesis on the type of traffic and thus diminishes its dependency on parameters such as bandwidth, Round Trip Time or the number of connexions. We start with a recently proposed adaptative approach, ARED, which performs a constant tuning of RED parameters according to the queue load. Our goal is to find a simple extension to ARED improving the predictability of performance measures like queueing delay and delay jitter without sacrificing the loss rate. We propose a new algorithm that sets the RED parameters and evaluate it by extensive simulations. Our results show that our algorithm can stabilize the queue and achieve a more predictable queue size without substantially increasing the loss rate. Finally, it keeps also the queue size away from buffer overflow and buffer underflow independently of the number of connections.