Congestion Control Algorithms: Open Questions Benno Overeinder NLnet Labs.

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.
A Survey of Recent High Speed TCP Variants
TCP--Revisited. Background How to effectively share the network? – Goal: Fairness and vague notion of equality Ideal: If N connections, each should get.
RED Enhancement Algorithms By Alina Naimark. Presented Approaches Flow Random Early Drop - FRED By Dong Lin and Robert Morris Sabilized Random Early Drop.
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.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Congestion Control Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.
Ahmed El-Hassany CISC856: CISC 856 TCP/IP and Upper Layer Protocols Slides adopted from: Injong Rhee, Lisong Xu.
Selfish Behavior and Stability of the Internet: A Game-Theoretic Analysis of TCP Presented by Shariq Rizvi CS 294-4: Peer-to-Peer Systems.
CUBIC Qian HE (Steve) CS 577 – Prof. Bob Kinicki.
Approximate Fair Control-delay (AF-CODEL) Queue over High-speed Networks Lin Xue Nov
Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.
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.
TCP in Wireless Ad Hoc Networks
Congestion Control Tanenbaum 5.3, /12/2015Congestion Control (A Loss Based Technique: TCP)2 What? Why? Congestion occurs when –there is no reservation.
1 Minseok Kwon and Sonia Fahmy Department of Computer Sciences Purdue University {kwonm, All our slides and papers.
Explicit Congestion Notification ECN Tilo Hamann Technical University Hamburg-Harburg, Germany.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
Networks: Congestion Control1 Congestion Control.
EE689 Lecture 5 Review of last lecture More on HPF RED.
TCP on High-Speed Networks Sangtae Ha and Injong Rhee North Carolina State University.
Sizing Router Buffers Nick McKeown Guido Appenzeller & Isaac Keslassy SNRC Review May 27 th, 2004.
1 Minseok Kwon and Sonia Fahmy Department of Computer Sciences Purdue University {kwonm, TCP Increase/Decrease.
A Switch-Based Approach to Starvation in Data Centers Alex Shpiner Joint work with Isaac Keslassy Faculty of Electrical Engineering Faculty of Electrical.
The Effect of Router Buffer Size on HighSpeed TCP Performance Dhiman Barman Joint work with Georgios Smaragdakis and Ibrahim Matta.
Reducing the Buffer Size in Backbone Routers Yashar Ganjali High Performance Networking Group Stanford University February 23, 2005
Medium Start in TCP-Friendly Rate Control Protocol CS 217 Class Project Spring 04 Peter Leong & Michael Welch.
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware Aug 19th / 2004 Rafael Nunez.
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.
1 Enabling Large Scale Network Simulation with 100 Million Nodes using Grid Infrastructure Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.
Understanding the Performance of TCP Pacing Amit Aggarwal, Stefan Savage, Thomas Anderson Department of Computer Science and Engineering University of.
CA-RTO: A Contention- Adaptive Retransmission Timeout I. Psaras, V. Tsaoussidis, L. Mamatas Demokritos University of Thrace, Xanthi, Greece This study.
Congestion Control - Supplementary Slides are adapted on Jean Walrand’s Slides.
1 TCP-BFA: Buffer Fill Avoidance September 1998 Amr A. Awadallah Chetan Rai Computer Systems.
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. August 2005 draft-ietf-dccp-tfrc-voip-02.txt Slides:
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.
15744 Course Project1 Evaluation of Queue Management Algorithms Ningning Hu, Liu Ren, Jichuan Chang 30 April 2001.
TCP CUBIC in ns-3 CS577 Brett Levasseur 12/10/2013.
Un-Cooperative Congestion Control Kartikeya Chandrayana Prof. Shivkumar Kalyanaraman ECSE Dept., R.P.I. (
A Self-Configuring RED Gateway Wu-chang Feng, Dilip Kandlur, Debanjan Saha, Kang Shin INFOCOM ‘99.
AQM & TCP models Courtesy of Sally Floyd with ICIR Raj Jain with OSU.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
VO2-MAGAZINE.jpg Michael Jenkins Presents:
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.
1 Computer Networks Congestion Avoidance. 2 Recall TCP Sliding Window Operation.
Internet research Needs Better Models Sally Floyd, Eddie Kohler ISCI Center for Internet Research, Berkeley, California Presented by Max Podlesny.
An Evaluation of Fairness Among Heterogeneous TCP Variants Over 10Gbps High-speed Networks Lin Xue*, Suman Kumar', Cheng Cui* and Seung-Jong Park* *School.
TCP Traffic Characteristics—Deep buffer Switch
Performance of New Variants of TCP Presenter – Bob Kinicki.
Peer-to-Peer Networks 13 Internet – The Underlay Network
1 Sheer volume and dynamic nature of video stresses network resources PIE: A lightweight latency control to address the buffer problem issue Rong Pan,
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 Stochastic Ordering for Internet Congestion Control Han Cai, Do Young Eun, Sangtae Ha, Injong Rhee, and Lisong Xu PFLDnet 2007 February 7, 2007.
On Queuing, Marking, and Dropping
TCP Vegas Congestion Control Algorithm
Topics discussed in this section:
CUBIC Marcos Vieira.
Introduction to Congestion Control
Generalizing The Network Performance Interference Problem
Analysis of Congestion Control Mechanisms in Congestion Control
FAST TCP : From Theory to Experiments
Project-2 (20%) – DiffServ and TCP Congestion Control
TCP Congestion Control
Review of Internet Protocols Transport Layer
Presentation transcript:

Congestion Control Algorithms: Open Questions Benno Overeinder NLnet Labs

NLnet Labs What This Talk is Not About Details of TCP congestion avoidance and control algorithms Research on improvements of TCP congestion avoidance algorithms Measurements of TCP congestion avoidance algorithm performance None of this, but –highlight current open question and future research

NLnet Labs Congestion Control Over the Years Global congestion collapse (1986) TCP Tahoe (1988) and TCP Reno (1990) TCP New Reno (1998) … TCP over long fat networks (2002–2003) TCP and bufferbloat (2011)

NLnet Labs Common Congestion Control Algorithms FreeBSD/Solaris –TCP New Reno –Reno: “classic” congestion avoidance –improves retransmission during the fast-recovery phase Linux –TCP CUBIC –BIC: optimized congestion control algorithm for LFN –CUBIC: less aggressive and more systematic derivative Windows –Compound TCP –achieve good performance for LFNs, while not harm fairness

NLnet Labs Fairness One mechanism at a time Mixed mechanisms

NLnet Labs SHAPE OF CONGESTION WINDOW INCREASE FUNCTION

NLnet Labs Shape of Congestion Window Increase Function

NLnet Labs Convex vs. Concave-Convex: H-TCP vs. CUBIC

NLnet Labs Distribution of cwnd for Convex and Concave Increase Distribution of cwnd at back-off for convex and concave updates versus loss probability. Key: + convex, o concave-convex

NLnet Labs BUFFERING AND BUFFERBLOAT

NLnet Labs Impact of Buffering Throughput and cwnd for Reno, buffer size 1 x BPD, 10 MBps link, 100 ms RTT. With buffering, flow throughput and cwnd are fundamentally different quantities, and only weakly related.

NLnet Labs Bufferbloat Trend to provide large buffers to network equipment –rule of thumb buffer to accommodate 250 ms traffic –e.g., 1 Gb/s interface requires 32 MB buffer Flow of packets slows down traveling from fast to slow network –buffer absorbs, temporary delay packets –packets queued in network only drops if buffer is full TCP congestion algorithm –relies on packet drops to determine available bandwidth –keeps speeding up and slowing down the transmission rate to find equilibrium –packet drops must occur in a timely manner –…

NLnet Labs Active Queue Management (AQM) Random Early Detection (RED) –random and early notification of congestion –variants FRED, SRED, with notion of flows –no synchronisation à la drop-tail CHOKe –penalize misbehaving flows –similar to SRED, but less complex CoDel –improve overall performance of RED –easier to manage, does not require manual configuration

NLnet Labs Congestion Control, Latency, and AQM

NLnet Labs CONCLUDING

NLnet Labs Remy Computer-Generated Congestion Control Specify –prior knowledge and assumptions of network –objective to achieve (e.g., throughput and delay) Outperforms existing (w/ ns2 simulations) –TCP New Reno, TCP Cubic, Compound (at end-points) –in many cases outperforms Cubic/FQ-CoDeL (requires network changes) Results for dumbbell topology, n=12, 15 Mbps.

NLnet Labs Summary Congestion control problem has changed –from: there is congestion, what do we do? –via: networks are empty, what do we do? –to: how do we get all this stuff deployed and let it interoperate? After 20+ years still interesting and important problem One size does not fit all? –FreeBSD modCC dynamic load/unload CC algorithm –For discussion: Internet at large might agree on model to prepare a “one-size-fits-all” Remy? IETF/IRTF –IETF: AQM, CONEX, RMCAT –IRTF: ICCRG