Active Queue Management

Active Queue Management

In Internet routers, Active Queue Management (AQM) is a technique that consists in dropping or ECN-marking packets before a router's queue is full.

Queue Management

An Internet router typically maintains a set of queues, one per interface, that hold packets scheduled to go out on that interface. Historically, such queues use a "drop-tail" discipline: a packet is put onto the queue if the queue is shorter than its maximum size (measured in packets or in bytes), and dropped otherwise.

Active queue disciplines drop or mark packets before the queue is full. Typically,they operate by maintaining one or more drop/mark probabilities, and probabilistically dropping or marking packets even when the queue is short.

Benefits of AQM

Drop-tail queues have a tendency to penalise bursty flows, and to cause global synchronisation between flows. By dropping packets probabilistically, AQM disciplines typically avoid both of these issues.

By providing endpoints with congestion indication before the queue is full, AQM disciplines are able to maintain a shorter queue length than drop-tail queues, which reduces network latency ("ping time").

Since AQM queues are never quite full, they can use ECN to mark packets instead of dropping them.

Drawbacks of AQM

Early AQM disciplines (notably RED and SRED) require careful tuning of their parameters in order to provide good performance. Modern AQM disciplines (ARED, Blue, PI) are self-tuning, and can be run with their default parameters in most or all circumstances.

AQM is counter-intuitive to many network engineers: "Why should I drop perfectly good packets when I still have free buffer space?"

AQM Algorithms

* Adaptive Virtual Queue (AVQ);
* Random early detection (RED);
* Random Exponential Marking (REM);
* Blue and Stochastic Fair Blue (SFB);
* PI controller.

See also

* Network congestion avoidance
* Explicit Congestion Notification (ECN)


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Active Queue Management — (AQM) (Активное Управление Очередью)  технология в сетевых маршрутизаторах, заключающаяся в отбрасывании или установлении флага ECN пакетов до того, как очередь маршрутизатора заполнится. Содержание 1 Управление очередью 1.1 Преимущества AQM …   Википедия

  • Active queue management — AQM (active queue management) Pour les articles homonymes, voir AQM. L active queue management ou gestion active de file d attente, est un ensemble de techniques utilisées pour traiter le problème de congestion dans les réseaux IP, tel que le… …   Wikipédia en Français

  • AQM (Active Queue Management) — Pour les articles homonymes, voir AQM. L active queue management ou gestion active de file d attente, est un ensemble de techniques utilisées pour traiter le problème de congestion dans les réseaux IP, tel que le réseau Internet. Ces techniques,… …   Wikipédia en Français

  • Aqm (active queue management) — Pour les articles homonymes, voir AQM. L active queue management ou gestion active de file d attente, est un ensemble de techniques utilisées pour traiter le problème de congestion dans les réseaux IP, tel que le réseau Internet. Ces techniques,… …   Wikipédia en Français

  • AQM (active queue management) — Pour les articles homonymes, voir AQM. L active queue management ou gestion active de file d attente, est un ensemble de techniques utilisées pour traiter le problème de congestion dans les réseaux IP, tel que le réseau Internet. Ces techniques,… …   Wikipédia en Français

  • Blue (queue management algorithm) — Blue [W. Feng, D. Kandlur, D. Saha, K. Shin. Blue: A New Class of Active Queue Management Algorithms. U. Michigan CSE TR 387 99, April 1999.] is an Active Queue Management algorithm. Like RED, it operates by randomly dropping or ECN marking… …   Wikipedia

  • Process management (computing) — Operating systems …   Wikipedia

  • Network congestion — In data networking and queueing theory, network congestion occurs when a link or node is carrying so much data that its quality of service deteriorates. Typical effects include queueing delay, packet loss or the blocking of new connections. A… …   Wikipedia

  • Network congestion avoidance — is a process used in computer networks to avoid congestion.The fundamental problem is that all network resources are limited, including router processing time and link throughput. Eg.: *today s (2006) Wireless LAN effective bandwidth throughput… …   Wikipedia

  • Random early detection — (RED), also known as random early discard or random early drop is an active queue management algorithm. It is also a congestion avoidance algorithm. [cite journal | last = Floyd | first = Sally | coauthors = Jacobson, Van | title = Random Early… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”