AQM Recommendation Fred Baker. History At IETF 86, TSVAREA decided to update the recommendation of RFC 2309 to not recommend the use of RED Argument:

Slides:



Advertisements
Similar presentations
Martin Suchara, Ryan Witt, Bartek Wydrowski California Institute of Technology Pasadena, U.S.A. TCP MaxNet Implementation and Experiments on the WAN in.
Advertisements

Measuring IP Performance Geoff Huston Telstra. What are you trying to measure? User experience –Responsiveness –Sustained Throughput –Application performance.
Appropriateness of Transport Mechanisms in Data Grid Middleware Rajkumar Kettimuthu 1,3, Sanjay Hegde 1,2, William Allcock 1, John Bresnahan 1 1 Mathematics.
Immediate ECN Mirja Kuhlewind, David Wagner, Juan Manuel Reyes Espinosa, Stuttgart Uni Bob Briscoe, BT IETF-88 TSVAREA Nov 2013 Bob Briscoe was part-funded.
CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
Hui Zhang, Fall Computer Networking TCP Enhancements.
Active Queue Management: Theory, Experiment and Implementation Vishal Misra Dept. of Computer Science Columbia University in the City of New York.
1 Updates on Backward Congestion Notification Davide Bergamasco Cisco Systems, Inc. IEEE 802 Plenary Meeting San Francisco, USA July.
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.
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.
The Power of Explicit Congestion Notification Aleksandar Kuzmanovic Northwestern University
Networks: Congestion Control1 Congestion Control.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
Building a Controlled Delay Assured Forwarding Class in DiffServ Networks Parag Kulkarni Nazeeruddin Mohammad Sally McClean Gerard Parr Michaela Black.
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168)
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
ACN: Congestion Control1 Congestion Control and Resource Allocation.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #8 Explicit Congestion Notification (RFC 3168) Limited Transmit.
Lecture 5: Congestion Control l Challenge: how do we efficiently share network resources among billions of hosts? n Last time: TCP n This time: Alternative.
The War Between Mice and Elephants By Liang Guo (Graduate Student) Ibrahim Matta (Professor) Boston University ICNP’2001 Presented By Preeti Phadnis.
Presented by Anshul Kantawala 1 Anshul Kantawala FAST TCP: From Theory to Experiments C. Jin, D. Wei, S. H. Low, G. Buhrmaster, J. Bunn, D. H. Choe, R.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
Rafael C. Nunez - Gonzalo R. Arce Department of Electrical and Computer Engineering University of Delaware May 19 th, 2005 Diffusion Marking Mechanisms.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware Aug 19th / 2004 Rafael Nunez.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
PCP: Efficient Endpoint Congestion Control To appear in NSDI, 2006 Thomas Anderson, Andrew Collins, Arvind Krishnamurthy and John Zahorjan University of.
Diffusion Early Marking Department of Electrical and Computer Engineering University of Delaware May / 2004 Rafael Nunez Gonzalo Arce.
1 1 July 28, Absent changes to the network can we actually do something? Yes Is there work in the area of measurements that can we do to create.
Draft-constantine-ippm-tcp-throughput-tm-02.txt 1 TCP Throughput Testing Methodology IETF 77 Anaheim Barry Constantine Reinhard.
IETF-87 AQM BoF Wesley Eddy Richard Scheffenegger Tue., 30. July :00, Potsdam 1 Room 30 July 20131IETF-87, Berlin,
Chapter 4. After completion of this chapter, you should be able to: Explain “what is the Internet? And how we connect to the Internet using an ISP. Explain.
© 2010 Cisco and/or its affiliates. All rights reserved. Cisco Confidential 1 Fred Baker.
Instructor: Christopher Cole Some slides taken from Kurose & Ross book IT 347: Chapter 1.
QOS مظفر بگ محمدی دانشگاه ایلام. 2 Why a New Service Model? Best effort clearly insufficient –Some applications need more assurances from the network.
1.1 What is the Internet What is the Internet? The Internet is a shared media (coaxial cable, copper wire, fiber optics, and radio spectrum) communication.
POSTECH DP&NM Lab. Internet Traffic Monitoring and Analysis: Methods and Applications (1) 2. Network Monitoring Metrics.
Elephants, Mice, and Lemmings! Oh My! Fred Baker Fellow 25 July 2014 Making life better in data centers and high speed computing.
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
1 Lecture 14 High-speed TCP connections Wraparound Keeping the pipeline full Estimating RTT Fairness of TCP congestion control Internet resource allocation.
Ch 1. Computer Networks and the Internet Myungchul Kim
DCTCP & CoDel the Best is the Friend of the Good Bob Briscoe, BT Murari Sridharan, Microsoft IETF-84 TSVAREA Jul 2012 Le mieux est l'ennemi du bien Voltaire.
HighSpeed TCP for High Bandwidth-Delay Product Networks Raj Kettimuthu.
Networking Fundamentals. Basics Network – collection of nodes and links that cooperate for communication Nodes – computer systems –Internal (routers,
Thoughts on the Evolution of TCP in the Internet (version 2) Sally Floyd ICIR Wednesday Lunch March 17,
PCP: Efficient Endpoint Congestion Control NSDI, 2006 Thomas Anderson, Andrew Collins, Arvind Krishnamurthy and John Zahorjan University of Washington.
An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.
The Benefits to Applications of using Explicit Congestion Notification (ECN) draft-welzl-ecn-benefits-00 89th IETF Meeting London, UK 4 March 2014 Michael.
1 Sheer volume and dynamic nature of video stresses network resources PIE: A lightweight latency control to address the buffer problem issue Rong Pan,
An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.
1 Lecture 15 Internet resource allocation and QoS Resource Reservation Protocol Integrated Services Differentiated Services.
Masaki Hirabaru (NICT) and Jin Tanaka (KDDI) Impact of Bottleneck Queue on Long Distant TCP Transfer August 25, 2005 NOC-Network Engineering Session Advanced.
1 Three ways to (ab)use Multipath Congestion Control Costin Raiciu University Politehnica of Bucharest.
Revisiting Transport Congestion Control Jian He UT Austin 1.
The Network Layer Congestion Control Algorithms & Quality-of-Service Chapter 5.
Impact of New CC on Cross Traffic
Internet Networking recitation #9
On Queuing, Marking, and Dropping
Topics discussed in this section:
Queuing and Queue Management
FAST TCP : From Theory to Experiments
Michael Welzl University of Oslo
Internet Networking recitation #10
Congestion Control, Quality of Service, & Internetworking
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Presentation transcript:

AQM Recommendation Fred Baker

History At IETF 86, TSVAREA decided to update the recommendation of RFC 2309 to not recommend the use of RED Argument: operational utility was low because of difficulty in configuration

My contribution I started with two approaches: An and subsequent draft on new recommendations draft-baker-aqm-recommendation, which incorporates recommendations and removes RED Various comments on the list Gorry Fairhurst offered to co-author Edited draft-baker-aqm-recommendation-02.txt

TARGET ISSUES

In access paths (Cable Modem, DSL, Mobile Internet) Generally results from folks building a deep queue with permissive drop thresholds One DSL Modem vendor provides ten seconds of queue depth In multi-layer networks (WiFi, Input-queued Switches) Channel Acquisition Delay Systems not only wait for their own queue, but to access network In WiFi, APs often try to accumulate traffic per neighbor to limit transition time In Input-queued switches, multiple inputs feeding the same output appear as unpredictable delay sources to each other In effect, managing delay through queue, not queue depth

Names withheld for customer/vendor confidentiality reasons Common social networking applications might have O(10 3 ) racks in a data center 42 1RU hosts per rack A dozen Virtual Machines per host O(2 19 ) virtual hosts per data center O(10 4 ) standing TCP connections per VM to other VMs in the data center When one opens a web page Thread is created for the client O(10 4 ) requests go out for data O(10 4 ) byte responses come back O(45 X 10 6 ) bytes in switch queues instantaneously At 10 GBPS, instant 36 ms queue depth

Mean Latency Correlates with Maximum Queue Depth Tail Drop Traffic Timings Typical variation in delay only at top of the queue

Mean Latency Correlates with target queue depth, min- threshold Additional Capacity to Absorb Bursts Provide queues that can absorb bursts under normal loads, but which manage queues to a shallow average depth Net effect: maximize throughput, minimize delay/loss, minimize SLA issues Dynamic range of configuration

DRAFT RECOMMENDATIONS

Conclusions/Recommendati ons 1. Network devices SHOULD implement some AQM mechanism 2. Deployed AQM algorithms SHOULD support Explicit Congestion Notification (ECN) as well as loss to signal congestion to endpoints. 3. The algorithms that the IETF recommends SHOULD NOT require operational (especially manual) configuration or tuning. 4. AQM algorithms SHOULD respond to measured congestion, not application profiles. 5. AQM algorithms SHOULD NOT interpret specific transport protocol behaviours. 6. Transport protocol congestion control algorithms SHOULD maximize their use of available capacity (when there is data to send) without incurring undue loss or undue round trip delay. 7. Research, engineering, and measurement efforts are needed regarding … flows that are unresponsive to congestion notification or are responsive, but are more aggressive than present TCP.