Revisiting adaptive RED: beyond AIMD algorithms

  • Authors:
  • Richard Marquez;Isbel González;Niliana Carrero;Yuri Sulbarán

  • Affiliations:
  • Departamento de Sistemas de Control, Escuela de Ingeniería de Sistemas, Facultad de Ingeniería, Universidad de Los Andes, Mérida, Venezuela;Departamento de Sistemas de Control, Escuela de Ingeniería de Sistemas, Facultad de Ingeniería, Universidad de Los Andes, Mérida, Venezuela;Departamento de Sistemas de Control, Escuela de Ingeniería de Sistemas, Facultad de Ingeniería, Universidad de Los Andes, Mérida, Venezuela;Departamento de Sistemas de Control, Escuela de Ingeniería de Sistemas, Facultad de Ingeniería, Universidad de Los Andes, Mérida, Venezuela

  • Venue:
  • NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a new MIMD Adaptive RED and revisit two well-known adaptive algorithms for ARED, (Feng et al., A Self Configuring RED Gateway, Infocom, 1999) and (Floyd et al., Adaptive RED). We use the steady-state relation between the maximum marking (dropping) probability, maxp, and the average queue length, q, to argue that different adaptive schemes, AIMD, MIMD, etc., can be proposed when maxp varies slowly. We model MIMD ARED and study stability. It is shown through ns-2 simulations that the performance and robustness properties of MIMD ARED are in fact similar to those of Floyd's ARED.