Quick-Start for TCP and IP Draft-amit-quick-start-03.txt A.Jain, S. Floyd, M. Allman, and P. Sarolahti ICIR, December 2004 www.icir.org/floyd/talks/quickstart-Dec04.pdf.

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.
Advanced satellite infrastructures in future global Grid computing: network solutions to compensate delivery delay Blasco Bonito, Alberto Gotta and Raffaello.
ELECTRONICS RESEARCH GROUP DEPARTMENT OF ENGINEERING IETF-68, March 19-23, 2007 Quick-Start for DCCP draft-fairhurst-tsvwg-dccp-qs-00 (Individual Submission)
CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
Traffic Shaping Why traffic shaping? Isochronous shaping
By Arjuna Sathiaseelan Tomasz Radzik Department of Computer Science King’s College London EPDN: Explicit Packet Drop Notification and its uses.
3-1 TCP Protocol r point-to-point: m one sender, one receiver r reliable, in-order byte steam: m no “message boundaries” r pipelined: m TCP congestion.
1 TCP Congestion Control. 2 TCP Segment Structure source port # dest port # 32 bits application data (variable length) sequence number acknowledgement.
Introduction 1 Lecture 14 Transport Layer (Transmission Control Protocol) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer.
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. March 2005, presentation to AVT draft-ietf-dccp-tfrc-voip-01.txt.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
An Implementation and Experimental Study of the eXplicit Control Protocol (XCP) Yongguang Zhang and Tom Henderson INFOCOMM 2005 Presenter - Bob Kinicki.
Chapter 3 Transport Layer slides are modified from J. Kurose & K. Ross CPE 400 / 600 Computer Communication Networks Lecture 12.
Transport Layer 3-1 Fast Retransmit r time-out period often relatively long: m long delay before resending lost packet r detect lost segments via duplicate.
Explicit Congestion Notification ECN Tilo Hamann Technical University Hamburg-Harburg, Germany.
Transport Layer3-1 Congestion Control. Transport Layer3-2 Principles of Congestion Control Congestion: r informally: “too many sources sending too much.
Transport Layer 3-1 Outline r TCP m Congestion control m Flow control.
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168) Limited Transmit (RFC 3042)
CSEE W4140 Networking Laboratory Lecture 7: TCP flow control and congestion control Jong Yul Kim
Week 9 TCP9-1 Week 9 TCP 3 outline r 3.5 Connection-oriented transport: TCP m segment structure m reliable data transfer m flow control m connection management.
High-performance bulk data transfers with TCP Matei Ripeanu University of Chicago.
1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168)
Promoting the Use of End-to- End Congestion Control in the Internet Sally Floyd and Kevin Fall Presented by Scott McLaren.
Data Communication and Networks
Transport Layer Congestion control. Transport Layer 3-2 Approaches towards congestion control End-to-end congestion control: r no explicit feedback.
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.
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.
Congestion Control for High Bandwidth-Delay Product Environments Dina Katabi Mark Handley Charlie Rohrs.
Whither Congestion Control? Sally Floyd E2ERG, July
3: Transport Layer3b-1 Principles of Congestion Control Congestion: r informally: “too many sources sending too much data too fast for network to handle”
Transport Layer3-1 Chapter 3 outline r 3.1 Transport-layer services r 3.2 Multiplexing and demultiplexing r 3.3 Connectionless transport: UDP r 3.4 Principles.
Changes in CCID 2 and CCID 3 Sally Floyd August 2004 IETF.
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::
Transport Layer1 Flow and Congestion Control Ram Dantu (compiled from various text books)
Principles of Congestion Control Congestion: informally: “too many sources sending too much data too fast for network to handle” different from flow control!
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.
Chapter 12 Transmission Control Protocol (TCP)
1 Internet Control Message Protocol (ICMP) Used to send error and control messages. It is a necessary part of the TCP/IP suite. It is above the IP module.
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::
HighSpeed TCP for High Bandwidth-Delay Product Networks Raj Kettimuthu.
Requirements for Simulation and Modeling Tools Sally Floyd NSF Workshop August 2005.
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:
Analysis of Buffer Size in Core Routers by Arthur Dick Supervisor Anirban Mahanti.
Improving our Evaluation of Transport Protocols Sally Floyd Hamilton Institute July 29, 2005.
1 Transport Layer Lecture 10 Imran Ahmed University of Management & Technology.
By N.Gopinath AP/CSE Unit: III Introduction to Transport layer.
Transport Layer3-1 Chapter 3 outline r 3.1 Transport-layer services r 3.2 Multiplexing and demultiplexing r 3.3 Connectionless transport: UDP r 3.4 Principles.
Thoughts on the Evolution of TCP in the Internet (version 2) Sally Floyd ICIR Wednesday Lunch March 17,
QoS in Mobile IP by Preethi Tiwari Chaitanya Deshpande.
XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science
Transport Layer3-1 Chapter 3 outline r 3.1 Transport-layer services r 3.2 Multiplexing and demultiplexing r 3.3 Connectionless transport: UDP r 3.4 Principles.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
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
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-02.txt.
11 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
Congestion Control for High Bandwidth-Delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs Presented by Yufei Chen.
Impact of New CC on Cross Traffic
Internet Networking recitation #9
HighSpeed TCP for Large Congestion Windows
Quick-Start for TCP and IP
Quick-Start for TCP and IP
Internet Networking recitation #10
TCP Overview.
Presentation transcript:

Quick-Start for TCP and IP Draft-amit-quick-start-03.txt A.Jain, S. Floyd, M. Allman, and P. Sarolahti ICIR, December

QuickStart with TCP, for setting the initial window: 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 sending rate, if necessary. 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 TCP sender continues using normal congestion control.. From an initial proposal by Amit Jain

The Quick-Start Request Option for IPv | Option | Length=4 | QS TTL | Rate | | | | | Request | Explicit feedback from all of the routers along the path would be required. This option will only be approved by routers that are significantly underutilized. No per-flow state is kept at the router.

Quick-Start in the NS Simulator Added to NS by Srikanth Sundarrajan.

A Failed QuickStart Request:

Changes from draft-amit-quick-start-02.txt: Using Quick-Start in the Middle of a Connection. –The request would be on the total rate, not on the additional rate. –Examples: after idle periods, mobility events. The request is now in bytes per second, not packets per second. New sections include: –When to use Quick-Start (QS) –TCP: Responding to a Loss of a QS Packet –Quick-Start with DCCP –Quick-Start in IP Tunnels

What would be needed in routers? T: Configured QuickStart threshold (in Bps). –Requires knowledge of output link bandwidth. L: Current link utilization (in Bps). R: Recent granted QuickStart requests (in Bps). –Requires state of aggregate of granted requests. Router algorithm: –Max request to grant: T - L - R Bps

Possible Initial Deployment Scenarios: Intranets: –Centralized control over end nodes and routers. –Could include high-bandwidth, high-delay paths to remote sites. Paths over satellite links: –High bandwidth, high delay 2G/3G networks: –RTTs of up to one second

Design Issues: IP Options, ICMP, or RSVP? IP Options: –Blocked by some middleboxes –Takes the slow path in routers? ICMP: –Blocked by some middleboxes. –Mechanisms would be needed to address all routers along the path, and get one answer. RSVP: –Soft state in routers is not needed.

Design issues: the encoding of the Rate Request Linear function: – Minimum request of 80 Kbps, maximum request of 255*minimum, or 20.5 Mbps. –80-Kbps increments Powers of two: –Use 4 bits of the 8-bit field. –Minimum request of 80 Kbps, maximum request of 2^14*minimum, or 1.3 Gbps. –Doubling the request from one to the next.

Related Work: Faster Start-up without modifying routers: –Packet-pair and extensions. Less-than-best-effort for the initial window. Other forms of feedback from routers: –Free buffer size, available bandwidth. New congestion control mechanisms. –E.g., XCP, AntiECN.

Questions: Would Quick-Start be deployable? –Given the chicken-and-egg problems (requiring deployment in both routers and end nodes).

Would QuickStart be deployable, given the tighter integration required across the Internet? End nodes can make spurious requests. Routers can grant requests inappropriately. Colluding access routers can cheat (though the benefit would be minimal). It would be harder to police end-nodes. Problems from middleboxes. Problems with congestion at non-IP queues. Additional delay for the QuickStart Request –(if it doesn’t take the fast path in routers).

Questions: Is something like this needed? –Are there going to be underutilized paths? Would the benefits of Quick-Start be worth the added complexity? –Quick-Start Request packets would not take the fast path in routers. What would be the relationship between Quick- Start and new router-based congestion control mechanisms (e.g., XCP)?