Adaptive Queue Management Algorithm - PowerPoint PPT Presentation

1 / 17
About This Presentation
Title:

Adaptive Queue Management Algorithm

Description:

Packet loss rates of Red and Blue over different queue size (1000 Tcp sources) ... Volume 10 , Issue 4 (August 2002) Or. http://www.thefengs.com/wuchang/work/blue ... – PowerPoint PPT presentation

Number of Views:126
Avg rating:3.0/5.0
Slides: 18
Provided by: lingya6
Category:

less

Transcript and Presenter's Notes

Title: Adaptive Queue Management Algorithm


1
Adaptive Queue Management Algorithm
  • Red vs. Blue
  • Presented by Hui Dong Lingyan
    Zhang
  • Ying B. Wang

2
Outline
  • Problems and Motivation
  • Congestion control and active queue management
    currently used today (RED)
  • BLUE algorithm
  • Performance comparison

3
Problems Motivation
  • High packet loss rates in
  • Tcp/Ip network traffic
  • Goal
  • Queue management algorithms for maximizing
    network efficiency in times of heavy congestion
  • 0 packet loss, 100 link utilization, low
    queuing delay

4
Red (Random Early Detection) Queue Management
Algorithm
  • Exponentially weighted moving average
  • of queue length
  • Min th lt L average queue lt Max th
  • Packets are randomly dropped or marked
  • L average queue gt Max th
  • All packets are dropped or marked
  • L Queue length.

5
Red Queue Management Algorithm
1
Pdrop
maxp
0
minth
maxth
Qave
6
RED example 7 time steps
L Mbs
Sources
Receivers
A
B
7
Disadvantage of RED
  • Does not adapt well to traffic
  • Reason
  • Rely on queue length as an estimator of
    congestion
  • Queue length grow shrink rapidly upon severity
    of congestion

8
Blue Queue Management Algorithm
  • Class of fundamentally different queue management
    algorithms
  • Decouple congestion management from queue length
  • Based on packet loss and link utilization history

9
Blue algorithm
  • Single dropping/marking probabilityPm
  • Increment upon packet loss increases
  • Decrease when link underutilized
  • Freeze value upon changing

Upon packet loss if ((now - last_update) gt
freeze_time) then Pm Pm ? 1 last_update
now Upon link idle if ((now - last_update) gt
freeze_time) then Pm Pm - ? 2 last_update
now
10
Ideal Scenario (Blue Algorithm)
L Mbs
Sources
Receivers
A
B
Rate L Mbs
Receiver generate DupACKs/ECN
Queue drops and/or ECN marks at steady rate Rate
Exactly what will keep sending rate at L Mbs
11
Performance comparison
  • Packet loss rates of Red and Blue over different
    queue size (1000 Tcp sources)

12
Performance comparison
  • Packet loss rates of Red and Blue over different
    queue size (4000 Tcp sources)

13
Performance comparison
  • Link utilization of Red and Blue

14
Advantage of Blue
  • Congestion control with minimal buffer
  • Reduce end-to-end delay
  • More memory for larger routing table
  • Allow legacy routers to perform well even with
    limited memory

15
Little Concerns about Blue
  • Parameters setting
  • -- freeze_time (Based on round-trip times of
    connections over the link)
  • It determines the minimum time interval
    between two successive updates of Pm.
  • Fast Ethernet, ATM, What about wireless or
    satellite link? Or heterogeneous network?
  • Can a Router be so Smart?

16
Resources Link
For more details, please go to IEEE/ACM
Transactions on Networking (TON) Volume 10 , 
Issue 4  (August 2002) Or http//www.thefe
ngs.com/wuchang/work/blue/
17
Comment question
?
Thank you for your time!
Write a Comment
User Comments (0)
About PowerShow.com