Presentation is loading. Please wait.

Presentation is loading. Please wait.

Analysis of Active Queue Management Jae Chung and Mark Claypool Computer Science Department Worcester Polytechnic Institute Worcester, Massachusetts, USA.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Analysis of Active Queue Management Jae Chung and Mark Claypool Computer Science Department Worcester Polytechnic Institute Worcester, Massachusetts, USA."— Presentation transcript:

1 Analysis of Active Queue Management Jae Chung and Mark Claypool Computer Science Department Worcester Polytechnic Institute Worcester, Massachusetts, USA http://perform.wpi.edu/

2 NCA 2003 WPI Analysis of AQM #2 Active Queue Management Queue Sink Outbound LinkRouterInbound Link Sink TCP ACK… Queue Sink Outbound LinkRouterInbound Link Sink TCP ACK… Queue Sink Outbound LinkRouterInbound Link Sink TCP ACK… Drop!!! Queue Sink Outbound LinkRouterInbound Link Sink TCP Queue Sink Outbound LinkRouterInbound Link Sink TCP AQM Congestion Congestion Notification… ACK… Queue Sink Outbound LinkRouterInbound Link Sink TCP AQM Advantages Reduce packet losses (due to queue overflow) Reduce queuing delay

3 NCA 2003 WPI Analysis of AQM #3 Related Work: Analysis of AQM Control Theory Approach (Hollot, Infocom 01) –Model TCP and AQM Behaviors (Laplace domain). –Apply Classical Control Theory (through analysis). –Params not obvious for understanding control info. Queue Law (Firoiu, Infocom 00) –Model Average TCP Throughput and the behavior of Average Queue Length at congested router. –Shows the impact of traffic parameters on AQM. –Not suitable for system stability analysis. –Good for analyzing and configuring AQMs using average queue.

4 NCA 2003 WPI Analysis of AQM #4 Contribution Extend Firoiu’s to a General Queue Law –Simplify the queue law to better illustrate the effect of traffic parameters on AQM. –Extend the queue law to support Explicit Congestion Notification (ECN) and study the impact of ECN on AQM congestion control. Analysis of RED-Family AQM –Evaluate RED-Family AQMs (RED, Gentle RED and Adaptive RED) –Demonstrate ECN gains on packet loss rates.

5 NCA 2003 WPI Analysis of AQM #5 Outline Introduction Queue Law Impact of ECN RED Family AQM Analysis of REDs Summary

6 NCA 2003 WPI Analysis of AQM #6 Average TCP Window (Bulk Transfers) Function of congestion notification p robability (CNP) only. Not affected by the number of flows (N), RTT or Service Rate (SR). Same for ECN and non-ECN flows.

7 NCA 2003 WPI Analysis of AQM #7 The General Queue Law

8 NCA 2003 WPI Analysis of AQM #8 General Queue Law Validation Used average TCP throughput mo del from (Padhye, Sigcomm 1998). Works well for ECN. Inaccurate for non-ECN: The TCP throughput model does not effectiv ely model Retransmission Timeout.

9 NCA 2003 WPI Analysis of AQM #9 Effect of Limiting TCP Window Window-limited (and short-lived) flows consume less bandwidth. Yet, they are less responsive to congestion notification

10 NCA 2003 WPI Analysis of AQM #10 Outline Introduction Queue Law Impact of ECN RED Family AQM Analysis of REDs Summary

11 NCA 2003 WPI Analysis of AQM #11 Impact of ECN on AQM ECN has no signaling packet loss. Requires higher CNP to keep the average queue at the same level. Helps the control system stability as less sensitive to CNP changes.

12 NCA 2003 WPI Analysis of AQM #12 Outline Introduction Queue Law Impact of ECN RED Family AQM Analysis of REDs Summary

13 NCA 2003 WPI Analysis of AQM #13 RED-Family AQM Queue law: p = g(q) Stable RED operating point p max th min th max p RED control function: p = h(q) 1 Random Early Detection (RED) q p q max th min th max p 1 Gentle RED 2 max th p q max th min th variable max p 1 Adaptive RED p q max th min th variable max p 1 Adaptive RED (w/ Gentle) 2 max th

14 NCA 2003 WPI Analysis of AQM #14 Simulation Configuration Dumbbell topology (SR = 20Mbps, Q = 500 pkts) Increase # of TCP flows (N = 50~300) each 50 sec. Implicit (drop) and ECN (configurations shown) p (300) max th (100) min th max p (0.1) q N=50N=100N=150N=200N=250N=300 rr s s s s s d d d d d SR = 20 Mbps max p limit (0.5) RTLD = 80 ms Q = 500 pkts

15 NCA 2003 WPI Analysis of AQM #15 Congested Router Queue (ECN Results)

16 NCA 2003 WPI Analysis of AQM #16 Packet Loss Rate

17 NCA 2003 WPI Analysis of AQM #17 Contribution The General Queue Law –Illustrated the effect of traffic parameters on AQM. –Discussed the impact of ECN traffic on AQM. –Provides mean to configure RED for ECN traffic. RED-Family AQM Evaluation –Showed the ECN gain on packet loss rate and the limitation of AQMs without ECN over Drop-Tail. –Provided an analysis on RED-Family AQM Gentle RED: may result in an unstable queue oscillation. Adaptive RED: can support a wide range of traffic loads.

18 NCA 2003 WPI Analysis of AQM #18 Future Work Extend our study to a mixture of ECN and non-ECN TCP flows. Building an adaptive AQM technique that makes use of our queue law to quickly adapt to a well-configured state in the presence of changing network loads.

19 Analysis of Active Queue Management Jae Chung and Mark Claypool Computer Science Department Worcester Polytechnic Institute Worcester, Massachusetts, USA http://perform.wpi.edu/

Download ppt "Analysis of Active Queue Management Jae Chung and Mark Claypool Computer Science Department Worcester Polytechnic Institute Worcester, Massachusetts, USA."

Similar presentations

Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.

Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
WHITE – Achieving Fair Bandwidth Allocation with Priority Dropping Based on Round Trip Time Name : Choong-Soo Lee Advisors : Mark Claypool, Robert Kinicki.

WHITE – Achieving Fair Bandwidth Allocation with Priority Dropping Based on Round Trip Time Name : Choong-Soo Lee Advisors : Mark Claypool, Robert Kinicki.
CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.

CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli University of Calif, Berkeley and Lawrence Berkeley National Laboratory SIGCOMM.

Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli University of Calif, Berkeley and Lawrence Berkeley National Laboratory SIGCOMM.
Active Queue Management: Theory, Experiment and Implementation Vishal Misra Dept. of Computer Science Columbia University in the City of New York.

Active Queue Management: Theory, Experiment and Implementation Vishal Misra Dept. of Computer Science Columbia University in the City of New York.
Dynamic-CBT Better Performing Active Queue Management for Multimedia Networking Jae Chung and Mark Claypool Computer Science Department Worcester Polytechnic.

Dynamic-CBT Better Performing Active Queue Management for Multimedia Networking Jae Chung and Mark Claypool Computer Science Department Worcester Polytechnic.
1 Updates on Backward Congestion Notification Davide Bergamasco Cisco Systems, Inc. IEEE 802 Plenary Meeting San Francisco, USA July.

1 Updates on Backward Congestion Notification Davide Bergamasco Cisco Systems, Inc. IEEE 802 Plenary Meeting San Francisco, USA July.
5/17/20151 Adaptive RED: An Algorithm for Increasing the Robustness of RED’s Active Queue Management or How I learned to stop worrying and love RED Presented.

5/17/20151 Adaptive RED: An Algorithm for Increasing the Robustness of RED’s Active Queue Management or How I learned to stop worrying and love RED Presented.
Selfish Behavior and Stability of the Internet: A Game-Theoretic Analysis of TCP Presented by Shariq Rizvi CS 294-4: Peer-to-Peer Systems.

Selfish Behavior and Stability of the Internet: A Game-Theoretic Analysis of TCP Presented by Shariq Rizvi CS 294-4: Peer-to-Peer Systems.
Modeling TCP Congestion Control Don Towsley UMass Amherst collaborators: T. Bu, W. Gong, C. Hollot, V. Misra.

Modeling TCP Congestion Control Don Towsley UMass Amherst collaborators: T. Bu, W. Gong, C. Hollot, V. Misra.
The War Between Mice and Elephants LIANG GUO, IBRAHIM MATTA Computer Science Department Boston University ICNP (International Conference on Network Protocols)

The War Between Mice and Elephants LIANG GUO, IBRAHIM MATTA Computer Science Department Boston University ICNP (International Conference on Network Protocols)
Max Min Fairness How define fairness? “ Any session is entitled to as much network use as is any other ” ….unless some sessions can use more without hurting.

Max Min Fairness How define fairness? “ Any session is entitled to as much network use as is any other ” ….unless some sessions can use more without hurting.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.

XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.

Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
Application, Network and Link Layer Measurements of Streaming Video over a Wireless Campus Network Passive & Active Measurement Workshop 05 Boston, MA,

Application, Network and Link Layer Measurements of Streaming Video over a Wireless Campus Network Passive & Active Measurement Workshop 05 Boston, MA,
One More Bit Is Enough Yong Xia, RPI Lakshminarayanan Subramanian, UCB Ion Stoica, UCB Shivkumar Kalyanaraman, RPI SIGCOMM’05, August 22-26, 2005, Philadelphia,

One More Bit Is Enough Yong Xia, RPI Lakshminarayanan Subramanian, UCB Ion Stoica, UCB Shivkumar Kalyanaraman, RPI SIGCOMM’05, August 22-26, 2005, Philadelphia,
The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP 2001 1.

The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP
“On Designing Improved Controllers for AQM Routers Supporting TCP Flows” The PI Controller Presented by Bob Kinicki.

“On Designing Improved Controllers for AQM Routers Supporting TCP Flows” The PI Controller Presented by Bob Kinicki.
ICN01 Colmar, France July 10, 20011 A Performance Study of Explicit Congestion Notification (ECN) with Heterogeneous TCP Flows Robert Kinicki and Zici.

ICN01 Colmar, France July 10, A Performance Study of Explicit Congestion Notification (ECN) with Heterogeneous TCP Flows Robert Kinicki and Zici.
Active Queue Management. Fundamental problem: Queues and TCP Queues –Queues are to absorb bursts of packets. –They are required for statistical multiplexing.

Active Queue Management. Fundamental problem: Queues and TCP Queues –Queues are to absorb bursts of packets. –They are required for statistical multiplexing.

Similar presentations

Ads by Google