TCP and SCTP RTO Restart draft-hurtig-tcpm-rtorestart-03 Michael Welzl 1 TCPM, 85 th IETF Meeting 6. 11. 2012.

Slides:



Advertisements
Similar presentations
Simulation-based Comparison of Tahoe, Reno, and SACK TCP Kevin Fall & Sally Floyd Presented: Heather Heiman September 10, 2002.
Advertisements

1 Transport Protocols & TCP CSE 3213 Fall April 2015.
Camarillo / Schulzrinne / Kantola November 26th, 2001 SIP over SCTP performance analysis
Go-Back-N Improve Stop-and-Wait by not waiting!
Presentation by Joe Szymanski For Upper Layer Protocols May 18, 2015.
1 TCP - Part II. 2 What is Flow/Congestion/Error Control ? Flow Control: Algorithms to prevent that the sender overruns the receiver with information.
1 Evaluating F-RTO (RFC 4138) Markku Kojo, Kazunori Yamamoto, Max Hata, Pasi Sarolahti Draft available at:
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. March 2005, presentation to AVT draft-ietf-dccp-tfrc-voip-01.txt.
Computer Networking Lecture 17 – More TCP & Congestion Control Copyright ©, Carnegie Mellon University.
Internet Networking Spring 2003 Tutorial 12 Limited Transmit RFC 3042 Long Thin Networks RFC 2757.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #11 TCP Eiffel (RFC 3522)
Congestion Control Tanenbaum 5.3, /12/2015Congestion Control (A Loss Based Technique: TCP)2 What? Why? Congestion occurs when –there is no reservation.
Explicit Congestion Notification ECN Tilo Hamann Technical University Hamburg-Harburg, Germany.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #7 TCP New Reno Vs. Reno.
1 Internet Networking Spring 2002 Tutorial 10 TCP NewReno.
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
1 Internet Networking Spring 2006 Tutorial 10 The Eifel Detection Algorithm for TCP RFC 3522.
1 Internet Networking Spring 2004 Tutorial 10 TCP NewReno.
CMPE 257 Spring CMPE 257: Wireless and Mobile Networking Spring 2005 E2E Protocols (point-to-point)
1 K. Salah Module 6.1: TCP Flow and Congestion Control Connection establishment & Termination Flow Control Congestion Control QoS.
TCP: flow and congestion control. Flow Control Flow Control is a technique for speed-matching of transmitter and receiver. Flow control ensures that a.
1 EE 122: Advanced TCP Ion Stoica TAs: Junda Liu, DK Moon, David Zats (Materials with thanks to Vern Paxson,
COMT 4291 Communications Protocols and TCP/IP COMT 429.
CS 4396 Computer Networks Lab
CSE 461 University of Washington1 Topic How TCP implements AIMD, part 1 – “Slow start” is a component of the AI portion of AIMD Slow-start.
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. August 2005 draft-ietf-dccp-tfrc-voip-02.txt Slides:
TCP and SCTP RTO Restart draft-hurtig-tcpm-rtorestart-02 Michael Welzl 1.
Chapter 5 Peer-to-Peer Protocols and Data Link Layer PART I: Peer-to-Peer Protocols ARQ Protocols and Reliable Data Transfer Flow Control.
1 TCP III - Error Control TCP Error Control. 2 ARQ Error Control Two types of errors: –Lost packets –Damaged packets Most Error Control techniques are.
HighSpeed TCP for High Bandwidth-Delay Product Networks Raj Kettimuthu.
Paper Review: Latency Evaluation of Networking Mechanisms for Game Traffic Jin, Da-Jhong.
Considerations of SCTP Retransmission Delays for Thin Streams Jon Pedersen 1, Carsten Griwodz 1,2 & Pål Halvorsen 1,2 1 Department of Informatics, University.
Improving application layer latency for reliable thin-stream By: Joel Fichter & Andrew Sitosky Src:
Copyright © Lopamudra Roychoudhuri
1 TCP - Part II Relates to Lab 5. This is an extended module that covers TCP data transport, and flow control, congestion control, and error control in.
Lecture 9 – More TCP & Congestion Control
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. March draft-ietf-dccp-tfrc-voip-01.txt
What is TCP? Connection-oriented reliable transfer Stream paradigm
Lecture 18 – More TCP & Congestion Control
1 F-RTO Update Pasi Sarolahti Markku Kojo Kazunori Yamamoto Max Hata IETF-72 / TCPM / Dublin, Ireland / July 28, 2008.
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP – III Reliability and Implementation Issues.
Computer Networking Lecture 18 – More TCP & Congestion Control.
Lab The network simulator ns The network simulator ns Allows us to watch evolution of parameters like cwnd and ssthresh Allows us to watch evolution of.
TCP: Transmission Control Protocol Part II : Protocol Mechanisms Computer Network System Sirak Kaewjamnong Semester 1st, 2004.
1 CS 4396 Computer Networks Lab TCP – Part II. 2 Flow Control Congestion Control Retransmission Timeout TCP:
1 TCP Timeout And Retransmission Chapter 21 TCP sets a timeout when it sends data and if data is not acknowledged before timeout expires it retransmits.
1 TCP - Part II Relates to Lab 5. This is an extended module that covers TCP data transport, and flow control, congestion control, and error control in.
1 TCP - Part II. 2 What is Flow/Congestion/Error Control ? Flow Control: Algorithms to prevent that the sender overruns the receiver with information.
1 Computer Networks Congestion Avoidance. 2 Recall TCP Sliding Window Operation.
TCP - Part II Relates to Lab 5. This is an extended module that covers TCP data transport, and flow control, congestion control, and error control in TCP.
CS 6401 Congestion Control in TCP Outline Overview of RENO TCP Reacting to Congestion SS/AIMD example.
TCP Timeout and Retransmission
TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.
TCP transfers over high latency/bandwidth networks & Grid DT Measurements session PFLDnet February 3- 4, 2003 CERN, Geneva, Switzerland Sylvain Ravot
Fall 2004FSU CIS 5930 Internet Protocols1 TCP – Data Exchange Reading: Section 24.4.
TCP Transmission Control Protocol Part 2 CH 23 Aseel Alturki.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
TCP/IP1 Address Resolution Protocol Internet uses IP address to recognize a computer. But IP address needs to be translated to physical address (NIC).
1 ICCCN 2003 Modelling TCP Reno with Spurious Timeouts in Wireless Mobile Environments Shaojian Fu School of Computer Science University of Oklahoma.
TCP - Part II.
TCP - Part II Relates to Lab 5. This is an extended module that covers TCP flow control, congestion control, and error control in TCP.
TCP and SCTP RTO Restart draft-ietf-tcpm-rtorestart-01 TCPM WG IETF-88
Hojun Lee TCP enhancements Hojun Lee 11/8/2018.
Chapter 5 TCP Transmission Control
TCP - Part II Relates to Lab 5. This is an extended module that covers TCP flow control, congestion control, and error control in TCP.
Lecture 19 – TCP Performance
Runa Barik, Simone Ferlin, Michael Welzl University of Oslo
27/02/2019 Improving retransmission delays for thin streams Andreas Petlund Simula Research Laboratory and University of Oslo Andreas Petlund 2007.
TCP III - Error Control TCP Error Control.
TCP: Transmission Control Protocol Part II : Protocol Mechanisms
Presentation transcript:

TCP and SCTP RTO Restart draft-hurtig-tcpm-rtorestart-03 Michael Welzl 1 TCPM, 85 th IETF Meeting

The problem Sometimes, RTO must be used for loss recovery – e.g., if a connection has 2 outstanding packets and 1 is lost However, the effective RTO often becomes RTO = RTO + t – Where t ≈ RTT [+delACK] Because the timer is restarted on each incoming ACK (RFC 6298, RFC 4960) SenderReceiver RTO Restart RTO t 2

TCP and SCTP RTO Restart To allow retransmissions after exactly RTO seconds, the timer is restarted as RTO = RTO – t – Requires storing the 4 most recent timestamps The modified restart is only used when – the number of outstanding segments < 4; – and there is no unsent data ready for transmission. – Thus, only flows incapable of FR can use modified RTO restart Risk of spurious timeout seemed low in initial experiments Note: this algorithm is still the same – Variations were proposed and discussed, but dismissed 3

RTO restart vs. TLP RTO restart – focus on thin streams, limited to max. 4 outstanding segments – makes the RTO timer expire after exactly RTO seconds more often TLP – send up to two "probe segments" when a different (Probe Timeout, PTO) timer fires – PTO timer is set to 2 RTTs, which is sometimes smaller than the RTO Spurious PTO is not a big deal compared to spurious RTO 4

Example: thin stream App-limited case – TLP: a "probe segment" is a new segment if new data is available, else a retransmission – PTO applies to max. 2 packets, RTO restart applies to max. 3 packets – PTO fires after 2 RTTs, RTO restart fires after (“correct”) RTO 5

Example: repeated web downloads End of a larger window – TLP: PTO timer fires after 2 RTTs – Spurious PTO: send up to 2 unnecessary packets – Spurious RTO from RTO restart: impact worse, but: Unlikely because of RTO variation “safety net” Spurious RTO’s effect limited if application’s sending pause > RTO (cwnd should become RW anyway) 6

Backup slides 7

What if we use both? TLP could kick in in situations where RTO restart does not TLP could overrule (= retransmit packets earlier) RTO restart in cases where (# outstanding segments < 4) and no new segments are available for transmission. RTO restart reduces the probability that TLP is activated because PTO might be farther than RTO 8

Faster Recovery Needed? One extra RTT could lead to performance problems for short-lived (e.g. web) and thin streams – Thin streams are flows that only use a fraction of the available bandwidth (e.g. signaling, online games, chat, VoIP, …) – IETF 78: Example: Anarchy Online [1] – Approx. 1% packet loss – Most loss recovered using RTOs – Maximum tolerable latency about 500 msec [2] 9 [1] A. Petlund, P. Halvorsen, P. F. Hansen, T. Lindgren, R. Casais, C. Griwodz "Network Traffic from Anarchy Online: Analysis, Statistics and Applications”, In Proc of ACM MMSys, February [2] M. Claypool and K. Claypool, “Latency and Player Actions in Online Games”, In Communications of the ACM, November 2006.

Performance Initial simulations – Ns-3 (with real Linux TCP) – Short-lived flows – Multiple clients served by one host – Large set of bw’s and delays Results show that – Loss recovery times are reduced with approximately 1 RTT on average – The amount of spurious RTOs is slightly higher than for regular TCP (<1% more) New experiments underway – Congestion losses – New RTO management alg. – To investigate burst situations more thoroughly 10 Results from 200 concurrent flows with 100 ms RTT