1 / 9

Quick-Start for TCP and IP

Quick-Start for TCP and IP. Draft-amit-quick-start-04.txt Jain, S. Floyd, M. Allman, and P. Sarolahti TSVWG, March 2005 Presentation last IETF: www.icir.org/floyd/talks. QuickStart with TCP, for setting the initial window :. In an IP option in the SYN packet,

matt
Download Presentation

Quick-Start for TCP and IP

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Quick-Start for TCP and IP Draft-amit-quick-start-04.txt Jain, S. Floyd, M. Allman, and P. Sarolahti TSVWG, March 2005 Presentation last IETF: www.icir.org/floyd/talks

  2. 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

  3. Changes fromdraft-amit-quick-start-03.txt: • Added a citation to the paper on "Evaluating Quick-Start for TCP", and added pointers to the work in that paper. • Discussions of router algorithms. • Discussions of sizing Quick-Start requests. • Added section on "Misbehaving Middleboxes”. • Added section on "Attacks on Quick-Start".

  4. “Evaluating Quick-Start for TCP” • Router algorithms: • Minimal algorithms at routers. • Also “Extreme Quick-Start” - • Maintains per-flow state for Quick-Start flows • Sizing the Quick-Start request. • Problems with overly-large Quick-Start requests. • Heuristics end-nodes could use in sizing requests. • URL “http://www.icir.org/floyd/quickstart.html”

  5. Attacks on Quick-Start: • Attacks to increase router’s processing load: • Easy to protect against - routers ignore Quick-Start when overloaded. • Attacks with bogus Quick-Start requests: • Harder to protect against. • Extreme Quick-Start in routers can help..

  6. Misbehaving Middleboxes: • Traffic normalizers that rewrite IP TTLs along the path? • Interferes with Quick-Start mechanism for validating a Quick-Start request.

  7. Feedback? • Are we ready for Working Group Last Call? • Experimental?

  8. Extra viewgraphs:

  9. Heuristics for Sizing Quick-Start Requests: • The sender doesn’t necessarily know the amount of data to be transmitted. • The sender knows more after an idle period. • End-hosts might know: • The capacity of last-mile hop. • The size of the local socket buffer. • The receiver’s advertised window. • Information from the application. • Past history of Quick-Start requests.

More Related