HighSpeed TCP for Large Congestion Windows

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

Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
TCP--Revisited. Background How to effectively share the network? – Goal: Fairness and vague notion of equality Ideal: If N connections, each should get.
1 Specifying New Congestion Control Algorithms Sally Floyd and Mark Allman draft-floyd-cc-alt-00.txt November 2006 TSVWG Slides:
CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
TCP Congestion Control Dina Katabi & Sam Madden nms.csail.mit.edu/~dina 6.033, Spring 2014.
CS640: Introduction to Computer Networks Mozafar Bag-Mohammadi Lecture 3 TCP Congestion Control.
Congestion Control: TCP & DC-TCP Swarun Kumar With Slides From: Prof. Katabi, Alizadeh et al.
Router-assisted congestion control Lecture 8 CS 653, Fall 2010.
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.
One More Bit Is Enough Yong Xia, RPI Lakshminarayanan Subramanian, UCB Ion Stoica, UCB Shivkumar Kalyanaraman, RPI SIGCOMM’05, August 22-26, 2005, Philadelphia,
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168) Limited Transmit (RFC 3042)
High-performance bulk data transfers with TCP Matei Ripeanu University of Chicago.
TCP Congestion Control TCP sources change the sending rate by modifying the window size: Window = min {Advertised window, Congestion Window} In other words,
Comparison between TCPWestwood and eXplicit Control Protocol (XCP) Jinsong Yang Shiva Navab CS218 Project - Fall 2003.
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168)
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #8 Explicit Congestion Notification (RFC 3168) Limited Transmit.
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
A DoS Limiting Network Architecture An Overview by - Amit Mondal.
Congestion Control for High Bandwidth-Delay Product Environments Dina Katabi Mark Handley Charlie Rohrs.
Whither Congestion Control? Sally Floyd E2ERG, July
Courtesy: Nick McKeown, Stanford 1 TCP Congestion Control Tahir Azim.
Quick-Start for TCP and IP A.Jain, S. Floyd, M. Allman, and P. Sarolahti ICSI, April 2006 This and earlier presentations::
Quick-Start for TCP and IP draft-ietf-tsvwg-quickstart-02.txt A.Jain, S. Floyd, M. Allman, and P. Sarolahti TSVWG, March 2006 This and earlier presentations::
Implementing High Speed TCP (aka Sally Floyd’s) Yee-Ting Li & Gareth Fairey 1 st October 2002 DataTAG CERN (Kinda!)
Adding Explicit Congestion Notification (ECN) Capability to TCP's SYN/ACK Packets A. Kuzmanovic, A. Mondal, S. Floyd, and K.K. Ramakrishnan draft-ietf-tcpm-ecnsyn-03.txt.
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
High-speed TCP  FAST TCP: motivation, architecture, algorithms, performance (by Cheng Jin, David X. Wei and Steven H. Low)  Modifying TCP's Congestion.
1 Standardizing New Congestion Control Algorithms Sally Floyd Workshop on High-speed TCP Microsoft February 5-6, 2007 Slides:
Quick-Start for TCP and IP draft-ietf-tsvwg-quickstart-01.txt A.Jain, S. Floyd, M. Allman, and P. Sarolahti TSVWG, November 2005 This and earlier presentations::
Requirements for Simulation and Modeling Tools Sally Floyd NSF Workshop August 2005.
Congestion Control for High Bandwidth-Delay Product Networks D. Katabi (MIT), M. Handley (UCL), C. Rohrs (MIT) – SIGCOMM’02 Presented by Cheng.
Quick-Start for TCP and IP Draft-amit-quick-start-04.txt A.Jain, S. Floyd, M. Allman, and P. Sarolahti TSVWG, March 2005 Presentation last IETF:
Quick-Start for TCP and IP Draft-amit-quick-start-03.txt A.Jain, S. Floyd, M. Allman, and P. Sarolahti ICIR, December
Improving our Evaluation of Transport Protocols Sally Floyd Hamilton Institute July 29, 2005.
Thoughts on the Evolution of TCP in the Internet (version 2) Sally Floyd ICIR Wednesday Lunch March 17,
Receiver Driven Bandwidth Sharing for TCP Authors: Puneet Mehra, Avideh Zakor and Christophe De Vlesschouwer University of California Berkeley. Presented.
Explicit Allocation of Best-Effort Service Goal: Allocate different rates to different users during congestion Can charge different prices to different.
XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science
Thoughts on the Evolution of TCP in the Internet Sally Floyd PFLDnet 2004 February 16, 2004.
Uni Innsbruck Informatik th IETF, PMTUD WG: Path MTU Discovery Using Options draft-welzl-pmtud-options-01.txt Michael Welzl
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP Congestion Control.
Congestion Control for High Bandwidth-Delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs Presented by Yufei Chen.
1 Flow & Congestion Control Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari Balakrishnan, and Sam Madden Prof. Dina Katabi.
Lecture 17 – TCP & Congestion Control
Impact of New CC on Cross Traffic
Adding ECN Capability to TCP’s SYN/ACK Packets
Internet Networking recitation #9
Chapter 3 outline 3.1 transport-layer services
Introduction to Congestion Control
CS 268: Lecture 6 Scott Shenker and Ion Stoica
Queue Management Jennifer Rexford COS 461: Computer Networks
Chapter 3 outline 3.1 Transport-layer services
Lecture 19 – TCP Performance
Prepared by Les Cottrell & Hadrien Bullot, SLAC & EPFL, for the
So far, On the networking side, we looked at mechanisms to links hosts using direct linked networks and then forming a network of these networks. We introduced.
Quick-Start for TCP and IP
Internet Research Needs a Critical Perspective Towards Models
Quick-Start for TCP and IP
Internet Networking recitation #10
Congestion Control, Internet Transport Protocols: UDP
If both sources send full windows, we may get congestion collapse
April 10, 2006, Northwestern University
TCP Congestion Control
Transport Layer: Congestion Control
Chapter 3 outline 3.1 Transport-layer services
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 by:
Review of Internet Protocols Transport Layer
DCCP: Issues From the Mailing List
Presentation transcript:

HighSpeed TCP for Large Congestion Windows Designed as minimal change to TCP to allow use of high-bandwidth paths. Response function: S=0.15/p^0.82, for S the sending rate in pkts/RTT. Limited Slow-Start. Approved by IETF as Experimental. Joint work with Sylvia Ratnasamy and Scott Shenker, additional contributions from Evandro de Souza, Deb Agarwal,Tom Dunigan. www.icir.org/floyd/papers/ Sections in the draft on: alternate response functions; PMTU; comparison with N parallel connections; drop-tail or RED; fairness with Standard TCP; convergence to fairness.

Performance of a HighSpeed TCP connection Bandwidth Avg Cwnd w (pkts) Increase a(w) Decrease b(w) 1.5 Mbps 12.5 1 0.50 10 Mbps 83 100 Mbps 833 6 0.35 1 Gbps 8333 26 0.22 10 Gbps 83333 70 0.10

Is HighSpeed TCP addressing a pressing problem in practice? Nope. Users can do one of the following: Open up N parallel TCP connections; or Use MulTCP (roughly like an aggregate of N virtual TCP connections). However, we can do better: Better flexibility (no N to configure); Better scaling (bandwidths, numbers of flows); Better slow-start behavior; Competing more fairly with current TCP (where TCP is able to use the available bandwidth).

QuickStart: How to start up quickly? An expired internet-draft. In an IP option in the SYN packet, the sender's desired sending rate: Routers on the path decrement a TTL counter, and decrease the allowed initial sending rate, if necessary.

QuickStart, cont. The receiver sends feedback to the sender in the SYN/ACK packet: The sender knows if all routers on the path participated. The sender has an RTT measurement. The sender can set the initial congestion window. The sender continues with AIMD as usual. From an initial proposal by Amit Jain.

How do we evaluate proposals in this space? Many metrics: utilization; delay; drop rates; fairness; convergence times; transfer times; oscillations. Models: competing traffic: range of connection sizes and of RTTs?; reverse-path traffic?; flows limited by slower links?; packet sizes? Balancing the present and the future: AQM or Drop-Tail? ECN? Many highspeed flows, or just one? E.g., "Internet Research Needs Better Models", with Eddie Kohler, Hotnets I.

Architectural sub-themes favoring incremental deployment: A goal of incremental deployment in the current Internet. Steps must go in the fundamentally correct, long-term direction, not be short-term hacks. Robustness in heterogeneous environments valued over efficiency of performance in well-defined environments. A preference for simple mechanisms, but a skepticism towards simple traffic and topology models. Learning from actual deployment is an invaluable step. The Internet will continue to be decentralized and fast-changing.