SCTP Tail Loss Recovery Enhancementss draft-nielsen-tsvwg-sctp-tlr-01.txt Karen E E Nielsen, Ericsson Tsvwg, IETF 91, Haweii.

Slides:



Advertisements
Similar presentations
TCP Variants.
Advertisements

1 SCTP Tutorial, Ottawa 7/2004 © 2004 Randall Stewart (Cisco Systems), Phill Conrad (University of Delaware). All rights reserved. DATA Chunk Flag Bits.
Simulation-based Comparison of Tahoe, Reno, and SACK TCP Kevin Fall & Sally Floyd Presented: Heather Heiman September 10, 2002.
Congestion Control Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.
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:
IETF87 Berlin DCTCP implementation in FreeBSD
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #11 TCP Eiffel (RFC 3522)
TCP Variations Naveen Manicka CISC 856 – Fall 2005 Computer & Information Sciences University of Delaware Nov 10, 2005 Most slides are borrowed from J.
Analyzing the jitter-attacks against TCP flows Mentors: Dr. Imad Aad, Prof. Jean-Pierre Hubaux Moumbe Arno Patrice 09 february 2005.
Presented by Prasanth Kalakota & Ravi Katpelly
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.
Simulation based analysis of FAST TCP using OMNET++ Umair ul Hassan.
High-performance bulk data transfers with TCP Matei Ripeanu University of Chicago.
1 Internet Networking Spring 2006 Tutorial 10 The Eifel Detection Algorithm for TCP RFC 3522.
1 Internet Networking Spring 2004 Tutorial 10 TCP NewReno.
Medium Start in TCP-Friendly Rate Control Protocol CS 217 Class Project Spring 04 Peter Leong & Michael Welch.
Transport Layer 4 2: Transport Layer 4.
A Simulation of Adaptive Packet Size in TCP Congestion Control Zohreh Jabbari.
Adaptive Failover Mechanism Motivation End-to-end connectivity can suffer during net failures Internet path outage detection and recovery is slow (shown.
COMT 4291 Communications Protocols and TCP/IP COMT 429.
TCP Timers Chia-tai Tsai Introduction The 7 Timers for each Connection Connection-Establishment Timer Establish a new connection.
TCP and SCTP RTO Restart draft-hurtig-tcpm-rtorestart-03 Michael Welzl 1 TCPM, 85 th IETF Meeting
1 Transport Protocols (continued) Relates to Lab 5. UDP and TCP.
TCP and SCTP RTO Restart draft-hurtig-tcpm-rtorestart-02 Michael Welzl 1.
HighSpeed TCP for High Bandwidth-Delay Product Networks Raj Kettimuthu.
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.
Copyright © Lopamudra Roychoudhuri
Computer Networking Lecture 18 – More TCP & Congestion Control.
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 Sonia FahmyPurdue University TCP Congestion Control Sonia Fahmy Department of Computer Sciences Purdue University
1 SIGCOMM ’ 03 Low-Rate TCP-Targeted Denial of Service Attacks A. Kuzmanovic and E. W. Knightly Rice University Reviewed by Haoyu Song 9/25/2003.
Reiner Ludwig – 57th IETF Meeting, July 2003Ericsson Research 1 Reiner Ludwig Ericsson Research Eifel Response Algorithm: Ready for WGLC? Andrei Gurtov.
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,
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.
Internet Networking recitation #11
TCP Timeout and Retransmission
TCP Congestion Control 컴퓨터공학과 인공지능 연구실 서 영우. TCP congestion control2 Contents 1. Introduction 2. Slow-start 3. Congestion avoidance 4. Fast retransmit.
Fall 2004FSU CIS 5930 Internet Protocols1 TCP – Data Exchange Reading: Section 24.4.
SCTP Tail Loss Recovery Advances of SCTP Fast Recovery Karen E E Nielsen, Ericsson, Tsvwg, IETF 90, Toronto.
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.
By, Nirnimesh Ghose, Master of Science,
Carles Gomez Universitat Politècnica de Catalunya (UPC)/Fundació i2cat
Transmission Control Protocol (TCP) Retransmission and Time-Out
Adding ECN Capability to TCP’s SYN/ACK Packets
NR-SACKs for SCTP (Non-Renegable SACKs)
TCP-in-UDP draft-welzl-irtf-iccrg-tcp-in-udp-00.txt
TFRC for Voice: VoIP Variant and Faster Restart.
TCP and SCTP RTO Restart draft-ietf-tcpm-rtorestart-01 TCPM WG IETF-88
SCTP v/s TCP – A Comparison of Transport Protocols for Web Traffic
Faster Restart for TCP Friendly Rate Control (TFRC)
NR-SACKs (Non-Renegable Selective Acknowledgments )‏
Hojun Lee TCP enhancements Hojun Lee 11/8/2018.
TCP - Part II Relates to Lab 5. This is an extended module that covers TCP flow control, congestion control, and error control in TCP.
CS4470 Computer Networking Protocols
Faster Restart for TCP Friendly Rate Control (TFRC)‏
TCP Friendly Rate Control (TFRC): Protocol Specification RFC3448bis
Jiyong Park Seoul National University, Korea
Sally Floyd and Eddie Kohler draft-floyd-ccid4-00.txt November 2006
Department of Informatics Networks and Distributed Systems (ND) group
Sally Floyd and Eddie Kohler draft-floyd-ccid4-01.txt July 2007
TCP: Transmission Control Protocol Part II : Protocol Mechanisms
Review of Internet Protocols Transport Layer
ECN in QUIC - Questions Surfaced
Designing a Relative Delay Estimator for Multipath Transport
Presentation transcript:

SCTP Tail Loss Recovery Enhancementss draft-nielsen-tsvwg-sctp-tlr-01.txt Karen E E Nielsen, Ericsson Tsvwg, IETF 91, Haweii

Status First draft, draft-nielsen-tsvwg-sctp-tlr- 01.txt, available Implementation done in SCTP SW ”RFC6675” improvements active in SCTP SW in deployment Experiments (test environment) are ongoing Plans for collaboration with other SCTP groups/other SCTP SWs for ver02 Now 13, 2014tsvwg - IETF 91 Haweii2

Goal Improve SCTP Fast Recovery (SCTP FR) where dupthres (=3) mis indications/SACKs don’t activate Fast Retransmission (not at all or late)  Primary: Improve latency of loss recovery  Secondary: Potential Throughput impr. (tbd) Presently supplements dupthres driven FR Potential Future ? Replace dupthres driven FR with new timer driver approach more robust to packet re-ordering Now 13, 2014tsvwg - IETF 91 Haweii3

SCTP Loss Recovery Improvements ”RFC6675 improved” SCTP FR – Mis indication counts robust towards loss of SACKs packet id variant and bytes variant (bytes variant not impl) – RFC6675 Last Resort features added to SCTP FR PTO Timer driven enter of FR (insp [1], [2]) – SACK of higher TSN within PTO  Enter FR PTO1= 1.5 SRTT + MAX(RTTVAR, Delay_ack) PTO2= 1.5 SRTT + RTTVAR PTO Timer driven Tail Loss Probing (insp by [1]) – TLPP sent if no SACK received within PTO – Rearm of timer as T3-timer of MAX(PTO, RTO-PTO) Now 13, 2014tsvwg - IETF 91 Haweii4

Simplified View More details see draft and/or Now 13, 2014tsvwg - IETF 91 Haweii5 No Gaps ACKs within PTO~1.5*SRTT Fast Recovery T3-Recovery No Gaps, No SACK within PTO Send TLPP - wait for SACK Gaps Wait for PTO to kick SACK PTO timer kicks T3-PTO timer kicks SACK CUMACK

ISSUES TLPP Recovery Masking algorithm (almost as of [1]) – may give spurious cwnd halving if TLPP is re-ordered with subsequently sent packets (as SACKed) – Possibly solution for SCTP is to introduce chunk id (Disscussed for other reasons as well, need protocol ext. ) PTO timers: – PTO1, PTO2 for further consolidation – 2*PTO ~worst case~ 3*SRTT + 2*delay_ack (ideal not > RTO) PTO-Restart ”as of” [3] (not fully analysed yet) – Possibly implementation by SCTP Packet id embedding timestamp – PTO restart conjectured to be unconditionally CC Issues (not analysed, work from TCP may apply) Now 13, 2014tsvwg - IETF 91 Haweii6

Some Preliminary RESULTS…. Now 13, 2014tsvwg - IETF 91 Haweii7

Functional tests Now 13, 2014tsvwg - IETF 91 Haweii8 Latency of Loss Recovery over a tail loss pattern over 6 SCTP packets transmitted instantly (IW of 4MTU) Latency = time from transmit (write) of packets to CUMACK all All combinations of tail loss patterns tested (drop filter in ETH egress). Results shows median value obtained over a number of tests. Variation only from timer-resolution issues. RTT, RTO_MIN, DELAY_ACK set to prevent algorithmic race conditions. No SACK loss, no RTT variation, no retransmission losses.

Now 13, 2014tsvwg - IETF 91 Haweii9 AAAAAA LSSSSS ALSSSS LLSSSS AALSSS LSLSSS ALLSSS LLLSSS AAALSS LSSLSS ALSLSS LLSLSS AALLSS LSLLSS ALLLSS LLLLSS AAAALS LSSSLS ALSSLS LLSSLS AALSLS LSLSLS ALLSLS LLLSLS AAALLS LSSLLS ALSLLS LLSLLS AALLLS LSLLLS ALLLLS LLLLLS AAAAAL LSSSSL ALSSSL LLSSSL AALSSL LSLSSL ALLSSL LLLSSL AAALSL LSSLSL ALSLSL LLSLSL AALLSL LSLLSL ALLLSL LLLLSL AAAALL LSSSLL ALSSLL LLSSLL AALSLL LSLSLL ALLSLL LLLSLL AAALLL LSSLLL ALSLLL LLSLLL AALLLL LSLLLL ALLLLL LLLLLL No improvement of RFC4960 Recovery

Now 13, 2014tsvwg - IETF 91 Haweii10 Evaluation of Results (1) Effects for One Tail Loss Event types AAAAAA LSSSSS ALSSSS LLSSSS AALSSS LSLSSS ALLSSS LLLSSS AAALSS LSSLSS ALSLSS LLSLSS AALLSS LSLLSS ALLLSS LLLLSS AAAALS LSSSLS ALSSLS LLSSLS AALSLS LSLSLS ALLSLS LLLSLS AAALLS LSSLLS ALSLLS LLSLLS AALLLS LSLLLS ALLLLS LLLLLS AAAAAL LSSSSL ALSSSL LLSSSL AALSSL LSLSSL ALLSSL LLLSSL AAALSL LSSLSL ALSLSL LLSLSL AALLSL LSLLSL ALLLSL LLLLSL AAAALL LSSSLL ALSSLL LLSSLL AALSLL LSLSLL ALLSLL LLLSLL AAALLL LSSLLL ALSLLL LLSLLL AALLLL LSLLLL ALLLLL LLLLLL PTO driven entering of FR TLPP sent No improvement of RFC4960 Recovery

Now 13, 2014tsvwg - IETF 91 Haweii11 Evaluation of Results (2) AAAAAA LSSSSS ALSSSS LLSSSS AALSSS LSLSSS ALLSSS LLLSSS AAALSS LSSLSS ALSLSS LLSLSS AALLSS LSLLSS ALLLSS LLLLSS AAAALS LSSSLS ALSSLS LLSSLS AALSLS LSLSLS ALLSLS LLLSLS AAALLS LSSLLS ALSLLS LLSLLS AALLLS LSLLLS ALLLLS LLLLLS AAAAAL LSSSSL ALSSSL LLSSSL AALSSL LSLSSL ALLSSL LLLSSL AAALSL LSSLSL ALSLSL LLSLSL AALLSL LSLLSL ALLLSL LLLLSL AAAALL LSSSLL ALSSLL LLSSLL AALSLL LSLSLL ALLSLL LLLSLL AAALLL LSSLLL ALSLLL LLSLLL AALLLL LSLLLL ALLLLL LLLLLL RFC6675 Effects RFC6675 speeds up FR compared with RFC4960

Synthetic Traffic (1) Bottleneck simulated by Gilbert-Elliott packet losses Now 13, 2014tsvwg - IETF 91 Haweii12

Synthetic Traffic (2) Bottleneck simulated by Gilbert-Elliott packet losses Now 13, 2014tsvwg - IETF 91 Haweii13 Statistics Under analysis. Double loss or 3) block in CC

References [1] Dukkipati et al., Tail Loss Probe (TLP): An Algorithm for Fast Recovery of Tail Losses, Expired work. loss-probe-01http://tools.ietf.org/html/draft-dukkipati-tcpm-tcp- loss-probe-01 [2] Dukkipati et al, "Proportional Rate Reduction for TCP", Proceedings of the 11th ACM SIGCOMM Conference on Internet Measurement 2011, Berlin, Germany, November [3] Hurtig et al, TCP and SCTP RTO Restart, draft-ietf-tcpm-rtorestart-04, Work In Progress July 22, 2014