A Self-Configuring RED Gateway Wu-chang Feng, Dilip Kandlur, Debanjan Saha, Kang Shin INFOCOM ‘99.

Slides:



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

Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 1 Department of Information Engineering University of Pisa Network Telecomunication.
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.
Congestion Control Algorithms: Open Questions Benno Overeinder NLnet Labs.
 Liang Guo  Ibrahim Matta  Computer Science Department  Boston University  Presented by:  Chris Gianfrancesco and Rick Skowyra.
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.
Worcester Polytechnic Institute The War Between Mice and Elephants Liang Guo, Ibrahim Matta Presented by Vasilios Mitrokostas for CS 577 / EE 537 Images.
Congestion Control An Overview -Jyothi Guntaka. Congestion  What is congestion ?  The aggregate demand for network resources exceeds the available capacity.
Explicit Congestion Notification (ECN) RFC 3168 Justin Yackoski DEGAS Networking Group CISC856 – TCP/IP Thanks to Namratha Hundigopal.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
School of Information Technologies TCP Congestion Control NETS3303/3603 Week 9.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-4690: Experimental Networking Informal Quiz: TCP Shiv Kalyanaraman:
Advanced Computer Networks: RED 1 Random Early Detection Gateways for Congestion Avoidance * Sally Floyd and Van Jacobson, IEEE Transactions on Networking,
Explicit Congestion Notification ECN Tilo Hamann Technical University Hamburg-Harburg, Germany.
1 Congestion Control Outline Queuing Discipline Reacting to Congestion Avoiding Congestion.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
Networks: Congestion Control1 Congestion Control.
TCP Stability and Resource Allocation: Part I. References The Mathematics of Internet Congestion Control, Birkhauser, The web pages of –Kelly, Vinnicombe,
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168) Limited Transmit (RFC 3042)
Low Delay Marking for TCP in Wireless Ad Hoc Networks Choong-Soo Lee, Mingzhe Li Emmanuel Agu, Mark Claypool, Robert Kinicki Worcester Polytechnic Institute.
RAP: An End-to-End Rate-Based Congestion Control Mechanism for Realtime Streams in the Internet Reza Rejai, Mark Handley, Deborah Estrin U of Southern.
1 Minseok Kwon and Sonia Fahmy Department of Computer Sciences Purdue University {kwonm, TCP Increase/Decrease.
WB-RTO: A Window-Based Retransmission Timeout Ioannis Psaras, Vassilis Tsaoussidis Demokritos University of Thrace, Xanthi, Greece.
1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug 1993), pp
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168)
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #8 Explicit Congestion Notification (RFC 3168) Limited Transmit.
Random Early Detection Gateways for Congestion Avoidance
Simulation of Explicit Congestion Notification and Random Early Detection Nadav Amit Teif Dmitry Yurovsky Denis.
TCP Congestion Control
Rafael C. Nunez - Gonzalo R. Arce Department of Electrical and Computer Engineering University of Delaware May 19 th, 2005 Diffusion Marking Mechanisms.
CS :: Fall 2003 TCP Friendly Streaming Ketan Mayer-Patel.
Ns Simulation Final presentation Stella Pantofel Igor Berman Michael Halperin
Analysis of Active Queue Management Jae Chung and Mark Claypool Computer Science Department Worcester Polytechnic Institute Worcester, Massachusetts, USA.
Diffusion Early Marking Department of Electrical and Computer Engineering University of Delaware May / 2004 Rafael Nunez Gonzalo Arce.
Advanced Computer Networks : RED 1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking,
Improving Internet Congestion Control and Queue Management Algorithms Wu-chang Feng March 17, 1999 Final Oral Examination.
A Simulation of Adaptive Packet Size in TCP Congestion Control Zohreh Jabbari.
Adaptive Packet Marking for Providing Differentiated Services in the Internet Wu-chang Feng, Debanjan Saha, Dilip Kandlur, Kang Shin October 13, 1998.
Understanding the Performance of TCP Pacing Amit Aggarwal, Stefan Savage, Thomas Anderson Department of Computer Science and Engineering University of.
Link Scheduling & Queuing COS 461: Computer Networks
Advanced Computer Networking
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
The Impact of Active Queue Management on Multimedia Congestion Control Wu-chi Feng Ohio State University.
A CTIVE Q UEUE M ANAGEMENT Comparing RED and BLUE Presentation held at: Telia Prosoft AB, Farsta, Sweden 2001-May-18 Thesis worker:Bartók István
AQM & TCP models Courtesy of Sally Floyd with ICIR Raj Jain with OSU.
Computer Networking Lecture 18 – More TCP & Congestion Control.
WB-RTO: A Window-Based Retransmission Timeout Ioannis Psaras Demokritos University of Thrace, Xanthi, Greece.
1 CS 4396 Computer Networks Lab TCP – Part II. 2 Flow Control Congestion Control Retransmission Timeout TCP:
We used ns-2 network simulator [5] to evaluate RED-DT and compare its performance to RED [1], FRED [2], LQD [3], and CHOKe [4]. All simulation scenarios.
The Macroscopic behavior of the TCP Congestion Avoidance Algorithm.
Stochastic Fair Blue An Algorithm For Enforcing Fairness Wu-chang Feng (OGI/OHSU) Dilip Kandlur (IBM) Debanjan Saha (Tellium) Kang Shin (University of.
Explicit Congestion Notification (ECN) RFC 3168
NOSSDAV '97 Understanding TCP Dynamics in an Integrated Services Internet Wu-chang Feng, Dilip Kandlur, Debanjan Saha, and Kang Shin.
Recap Slow start introduced cwnd Slow start introduced cwnd Can transmit up to Can transmit up to min( cwnd, offered window ) Flow control by the sender.
Peer-to-Peer Networks 13 Internet – The Underlay Network
ECEN 619, Internet Protocols and Modeling Prof. Xi Zhang Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions.
1 Flow & Congestion Control Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari Balakrishnan, and Sam Madden Prof. Dina Katabi.
Internet Networking recitation #9
Blue: An Alternative Approach to Active Queue Management
Lecture 19 – TCP Performance
Analysis of Congestion Control Mechanisms in Congestion Control
Internet Networking recitation #10
If both sources send full windows, we may get congestion collapse
Project-2 (20%) – DiffServ and TCP Congestion Control
TCP Congestion Control
Review of Internet Protocols Transport Layer
Presentation transcript:

A Self-Configuring RED Gateway Wu-chang Feng, Dilip Kandlur, Debanjan Saha, Kang Shin INFOCOM ‘99

Outline Motivation Background (TCP, Drop-tail, RED queue management) RED, packet loss, and ECN Adaptive RED Conclusion

Motivation Exponential increase in network demand –Rise in packet loss rates 17% loss rates reported [Paxson97] –Decrease in link utilization and goodput –Two essential ingredients for congestion collapse [Jacobson88]

Congestion Control Today TCP –Instrumental in preventing congestion collapse –Limits transmission rate at the source –Window-based rate control Increased and decreased based on implicit signals from the network (acknowledgments and packet loss) Slow-start Fast-retransmit, Fast-recovery Congestion avoidance

Example of TCP Windowing RTT W W+1 2W Congestion avoidance Fast Retransmit/Recovery Slow-start

Random Early Detection Drop-tail queue management –Default queue management mechanism –Packets dropped upon queue overflow –Global synchrony –Poor link utilization –Excess packet loss due to late congestion notification –Potentially large queuing delay RED –Randomize congestion notification –Early detection of incipient congestion

RED Queue Management RED (Random Early Detection) [Floyd93] –Keep EWMA of queue length (Q ave ) –Increase in EWMA triggers random drops Basic algorithm P drop 0 1 max p min th max th Q ave

This Work Without ECN –RED has minimal effect on packet loss With ECN –RED has a hard time Avoiding packet loss Avoiding under-utilization Avoiding global synchrony Controlling queuing delay Problem –RED is not adaptive to congestion A solution –Adaptive RED

RED and Packet Loss Impact of RED on loss rates minimal Experiment –64 connections over full-duplex Ethernet links –Simulated in ns –Verified over smaller FreeBSD/ALTQ testbed 100 Mbs 10 Mbs 100 Mbs

RED and Packet Loss Loss rates are a first order function of TCP

TCP Revisited RTT W W+1 2W 1/p = W + (W+1) + … + 2W = 3W 2 /4 W/2 RTTs RTT*(W/2) RTT*sqrt(p) N BW = MSS*(3W 2 /4) = MSS*C = L p = N * MSS * C L * RTT 2

Comments on Model Reducing N - [Balakrishnan98] Increasing RTT - [Villamizar94] Decreasing MSS - [Feng98] Loss rates as a function of N between linear and quadratic –Fair share assumption (L/N) - [Morris97] –No retransmission timeouts - [Padhye98] p = N * MSS * C L * RTT 2

ECN Without ECN, packet loss rates will remain high IETF ECN WG (1998) RFC January 1999 (Experimental standard) –2-bits in “DS Field” of IPv4/IPv6 headers (ECT, CE) –2-bits in “TCP Flags” field of TCP (CWR, ECN Echo)

RED and Packet Loss Even with ECN, RED does not eliminate packet loss Problem –RED is not adaptive to congestion level –max p constant Congestion notification vs. number of connections –N = number of connections –Offered load reduced by [1 - (1/2N)] per notification

RED Experiments 100 Mbs 10 Mbs 45 Mbs RED queue (min th =20K, max th =80K, Q size =80K) 8 or 32 TCP sources using ECN Conservative vs. aggressive early detection Simulated in ns –Aggressive detection: max p = –Conservative detection: max p = 0.016

Aggressive Early Detection 8 sources32 sources

Conservative Early Detection 8 sources32 sources

Conservative Early Detection 32 sources, Q len = 120KB

Adaptive RED Adapt max p based only on queue behavior (not N) Increase max p when Q ave crosses above max th Decrease max p when Q ave crosses below min th Freeze max p after changes to prevent oscillations P drop 0 1 max p min th max th Q ave

Evaluation Workload varied between 8 and 32 sources 100 Mbs 10 Mbs 45 Mbs RED queue (min th =20K, max th =80K, Q size =120K) 1ms 5ms 100ms 5ms

Static Early Detection AggressiveConservative

Adaptive RED Queue lengthmax p

Implementation FreeBSD ALTQ Ascend, Cisco 100 Mbs 10 Mbs 200 MHz 32 MB 233 MHz 128 MB 200 MHz 64 MB 50 KB RED queue 166 MHz 32 MB

Adaptive RED Performance Loss ratesLink utilization

Conclusion Without ECN –RED does not impact packet loss rates With ECN –RED still has trouble adapting to workload Adaptive RED can improve performance Future work –Deployment issues –Tuning additional RED parameters –Eliminating loss with SubTCP –Influence on fairness extensions to RED –