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.

Slides:



Advertisements
Similar presentations
TCP Variants.
Advertisements

Multicast Tree Reconfiguration in Distributed Interactive Applications Pål Halvorsen 1,2, Knut-Helge Vik 1 and Carsten Griwodz 1,2 1 Department of Informatics,
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.
1 TCP Vegas: New Techniques for Congestion Detection and Avoidance Lawrence S. Brakmo Sean W. O’Malley Larry L. Peterson Department of Computer Science.
24-1 Chapter 24. Congestion Control and Quality of Service (part 1) 23.1 Data Traffic 23.2 Congestion 23.3 Congestion Control 23.4 Two Examples.
1 Transport Protocols & TCP CSE 3213 Fall April 2015.
Camarillo / Schulzrinne / Kantola November 26th, 2001 SIP over SCTP performance analysis
Hui Zhang, Fall Computer Networking TCP Enhancements.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Congestion Control Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.
Flow and Error Control. Flow Control Flow control coordinates the amount of data that can be sent before receiving acknowledgement It is one of the most.
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 TCP CSE May TCP Services Flow control Connection establishment and termination Congestion control 2.
Fundamentals of Computer Networks ECE 478/578 Lecture #21: TCP Window Mechanism Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #07 Shivkumar Kalyanaraman: GOOGLE: “Shiv RPI”
Transport Protocol Enhancements for Thin Streams Magda El Zarki Prof. of CS Univ. of CA, Irvine
Albert Greenberg, Cheng Huang, Randy Kern, Dave Maltz, Jitu Padhye, Parveen Patel, Lihua Yuan *with help from MurariS and others in COSD.
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.
1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.
1 Internet Networking Spring 2004 Tutorial 10 TCP NewReno.
Department of Electronic Engineering City University of Hong Kong EE3900 Computer Networks Transport Protocols Slide 1 Transport Protocols.
CMPE 257 Spring CMPE 257: Wireless and Mobile Networking Spring 2005 E2E Protocols (point-to-point)
Copyright © 2005 Department of Computer Science CPSC 641 Winter Tutorial: TCP 101 The Transmission Control Protocol (TCP) is the protocol that sends.
Error Checking continued. Network Layers in Action Each layer in the OSI Model will add header information that pertains to that specific protocol. On.
Qian Zhang Department of Computer Science HKUST Advanced Topics in Next- Generation Wireless Networks Transport Protocols in Ad hoc Networks.
COMT 4291 Communications Protocols and TCP/IP COMT 429.
CS 4396 Computer Networks Lab
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.
TCP1 Transmission Control Protocol (TCP). TCP2 Outline Transmission Control Protocol.
Transport Layer Moving Segments. Transport Layer Protocols Provide a logical communication link between processes running on different hosts as if directly.
Transport over Wireless Networks Myungchul Kim
TCP and SCTP RTO Restart draft-hurtig-tcpm-rtorestart-02 Michael Welzl 1.
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.
Paper Review: Latency Evaluation of Networking Mechanisms for Game Traffic Jin, Da-Jhong.
Improving application layer latency for reliable thin-stream By: Joel Fichter & Andrew Sitosky Src:
1 End-to-End Protocols (UDP, TCP, Connection Management)
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
Forward Error Correction vs. Active Retransmit Requests in Wireless Networks Robbert Haarman.
What is TCP? Connection-oriented reliable transfer Stream paradigm
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 - 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.
ACN: Transport Protocols in Mobile Environments 1 Improving the Performance of Reliable Transport Protocols in Mobile Computing Environments Ramon Caceres.
TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.
Transport Layer: Sliding Window Reliability
1/12 WiSE: A Novel Efficient Transport Protocol for Wireless Networks Roberta Fracchia Joint work with C. Casetti, C. Chiasserini, M. Meo.
CPSC TCP Plots r Slides originally from Williamson at Calgary r Minor modifications are made.
COSC 3213: Computer Networks I Instructor: Dr. Amir Asif Department of Computer Science York University Section M Topics: 1.Flow Control and ARQ Protocols.
Peer-to-Peer Networks 13 Internet – The Underlay Network
TCP/IP1 Address Resolution Protocol Internet uses IP address to recognize a computer. But IP address needs to be translated to physical address (NIC).
Performance Evaluation of L3 Transport Protocols for IEEE (2 nd round) Richard Rouil, Nada Golmie, and David Griffith National Institute of Standards.
TCP - Part II.
Chapter 5 TCP Sequence Numbers & TCP Transmission Control
COMP 431 Internet Services & Protocols
Limited Transmit & Early Retransmit for TCP
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.
CS4470 Computer Networking Protocols
Chapter 17. Transport Protocols
27/02/2019 Improving retransmission delays for thin streams Andreas Petlund Simula Research Laboratory and University of Oslo Andreas Petlund 2007.
TCP: Transmission Control Protocol Part II : Protocol Mechanisms
Presentation transcript:

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 of Oslo, Norway 2 Simula Research Laboratory, Norway {jonped, griff, LCN 2006: 31st IEEE Conference on Local Computer Networks, Tampa, FL, USA, November 2006

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 Overview Latency problems for thin streams SCTP as an alternative to TCP Experiments New experiments Conclusions

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 Thins Streams Transport protocols being developed for throughput-bound applications  BUT, there exist several low-rate, time-dependent applications Anarchy Online MMORPG Case Study  average delay:~250 ms  max delay: 67 seconds (6 retransmissions)  packets per second: < 4 (less then one per RTT)  average packet size: ~120 bytes  average bandwidth requirement: ~4 Kbps All TCP variations available in Linux (2.6.15) fail to properly support time - dependent “thin streams”  targeted for high rate streams only [nossdav 2006]

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 Stream Control Transmission Protocol Network senderreceiver (re)transmission queue SACK SCTP should support signaling  acknowledged error-free transfers  data fragmentation according to MTU  packet boundary maintenance  sequenced delivery within multiple streams  bundling  partial reliability  …  suppose to address low latencies “require response between 500 – 1200 ms” … or “initiation of error procedures” [rfc 2719]

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 Test Set Up Linux with lksctp 100 bytes packets 4 packets per second  3.2 Kbps SCTP Network emulated using netem dropp delays (RTTs: 0, 100, 200, 400 ms)

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 Results: lksctp for Thins Streams Even worse than TCP!!! Why these high delays? Two ways of triggering retransmissions of a lost chunk…

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 Retransmission by Time-Out Network senderreceiver (re)transmission queue retransmission of packet with green chunks due to timeout Timeout is dependent on  minRTO = 1000 ms  estimated RTT based on SACKs BUT SACKs are delayed o one ACK for two packets or o 200 ms timer  influences estimated RTT, especially for thin streams  RTO value grows SACK

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 Retransmission by Fast Retransmit Network senderreceiver SACK no SACK no SACK no SACK no 4 SACKs needed for fast retransmit +thin streams = “all” retransmissions due to timeouts

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 Enhancement: Removal of Exponential Backoff Network senderreceiver (re)transmission queue retransmission of green packet due to timeout ENHANCEMENT: remove exponential backoff retransmission number time in RTTS

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 Enhancement: Fast Retransmit Bundling Network senderreceiver retransmission queue retransmission of green packet (chunks) due to dupACKs blue packet is NOT piggybacked when dupACKs (but would be if due to timeout) ENHANCEMENT: piggyback all chunks in retransmission queue SACK no SACK no SACK no SACK no

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 Enhancements Modified retransmission timer  removal of exponential backoff  minRTO = 200 ms (as in TCP) Modified retransmission bundling  always allow aggressive bundling for fast retransmit Modified fast retransmit  tested fast retransmit after 1 SACK Thin stream detection  fewer packets in flight to trigger a fast retransmit  added tracking of outstanding packets  less than 4 in flight = thin stream

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 Enhancement: Results (200 ms) Considerable reduction in average and maximum latencies Increase in number of fast retransmissions compared to timeouts  Increase in number of retransmissions original SCTPreduced minRTO & fast retransmit modified timer restartno SACK delay Timeout Fast retransmit Total

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 New lksctp versions & New Test Set Up New lksctp versions has been developed  lksctp in ( ) only one retransmission due to fast retransmit, next timeout only 3 SACKs required for fast retransmits  lksctp in has no major changes for our scenario New tests  100 B packets  RTTs: 0, 50, 100, 150, 200, 250 ms  Packet inter-arrival times: 50, 100, 150, 200, 250 ms  Dynamic thin stream detection  Many web-connections generating cross traffic (and thus losses) SCTP WEB

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 Results: New lksctp  Still high average and worst case latencies

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 Results: Fast Retransmission Modification Reduction in maximum and average latency As expected a large increase in fast retransmit  An increase in spurious retransmissions Fast retransmit modification – 1 SACK

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 Results: Removed Exponential Backoff Reduction in maximum and average latency  An increase in spurious retransmissions Retransmission aggressiveness does not really pose a congestion threat since the amount of data waiting to be sent is always less than the minimum transmission window Removed exponential backoff

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 Results: Reduced Minimum Time-out Faster timeouts Reduction in maximum and average latency  An increase in spurious retransmissions Reduced minRTO

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 Results: All Modifications Combined A further reduction in maximum and average latency As expected an increase in fast retransmit  An increase in spurious retransmissions All thin stream modifications

2006 Jon Pedersen, Carsten Griwodz & Pål Halvorsen LCN 2006, Tampa, FL, USA, November 2006 Conclusions Based on SCTP description we expected (hoped for) reduced latencies compared to TCP Enhancements like  reduced minRTO  removal of exponential backoff  removal of delayed SACKs  … reduce latencies for thin streams The enhancements increase the number of spurious retransmissions, but maybe not important for thin streams!!??