Increasing TCP's CWND based on Throughput draft-you-iccrg-throughput-based-cwnd-increasing-00 Jianjie You IETF92 Dallas.

Slides:



Advertisements
Similar presentations
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 1 Department of Information Engineering University of Pisa Network Telecomunication.
Advertisements

A Survey of Recent High Speed TCP Variants
TCP Variants.
TCP transfers over high latency/bandwidth network & Grid TCP Sylvain Ravot
FAST TCP Anwis Das Ajay Gulati Slides adapted from : IETF presentation slides Link:
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.
TCP Vegas: New Techniques for Congestion Detection and Control.
Different TCP Flavors CSCI 780, Fall TCP Congestion Control Slow-start Congestion Avoidance Congestion Recovery Tahoe, Reno, New-Reno SACK.
Restricted Slow-Start for TCP William Allcock 1,2, Sanjay Hegde 3 and Rajkumar Kettimuthu 1,2 1 Argonne National Laboratory 2 The University of Chicago.
Presentation by Joe Szymanski For Upper Layer Protocols May 18, 2015.
CUBIC Qian HE (Steve) CS 577 – Prof. Bob Kinicki.
Congestion Control Tanenbaum 5.3, /12/2015Congestion Control (A Loss Based Technique: TCP)2 What? Why? Congestion occurs when –there is no reservation.
1 Lecture 10: TCP Performance Slides adapted from: Congestion slides for Computer Networks: A Systems Approach (Peterson and Davis) Chapter 3 slides for.
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
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.
TCP Congestion Control TCP sources change the sending rate by modifying the window size: Window = min {Advertised window, Congestion Window} In other words,
Congestion Avoidance and Control CSCI 780, Fall 2005.
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.
TCP Congestion Control
Introduction 1 Lecture 14 Transport Layer (Congestion Control) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science.
Transport Layer 4 2: Transport Layer 4.
Changes in CCID 2 and CCID 3 Sally Floyd August 2004 IETF.
Copyright © Lopamudra Roychoudhuri
An Efficient Approach for Content Delivery in Overlay Networks Mohammad Malli Chadi Barakat, Walid Dabbous Planete Project To appear in proceedings of.
TCP Vegas Kulan Kao 2006/3/25.
1 Transport Protocols (continued) Relates to Lab 5. UDP and TCP.
CA-RTO: A Contention- Adaptive Retransmission Timeout I. Psaras, V. Tsaoussidis, L. Mamatas Demokritos University of Thrace, Xanthi, Greece This study.
Chapter 12 Transmission Control Protocol (TCP)
指導教授:林仁勇 老師 學生:吳忠融 2015/10/24 1. Author Chan, Y.-C. Chan, C.-T. Chen, Y.-C. Source IEE Proceedings of Communications, Volume 151, Issue 1, Feb 2004 Page(s):107.
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
Transport Layer3-1 Announcements r Collect homework r New homework: m Ch3#3,4,7,10,12,16,18-20,25,26,31,33,37 m Due Wed Sep 24 r Reminder: m Project #1.
High-speed TCP  FAST TCP: motivation, architecture, algorithms, performance (by Cheng Jin, David X. Wei and Steven H. Low)  Modifying TCP's Congestion.
Transport Layer3-1 TCP throughput r What’s the average throughout of TCP as a function of window size and RTT? m Ignore slow start r Let W be the window.
Lecture 9 – More TCP & Congestion Control
Murari Sridharan and Kun Tan (Collaborators: Jingmin Song, MSRA & Qian Zhang, HKUST.
Transport Layer 3-1 Chapter 3 Transport Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March
Compound TCP in NS-3 Keith Craig 1. Worcester Polytechnic Institute What is Compound TCP? As internet speeds increased, the long ‘ramp’ time of TCP Reno.
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 Computer Networks Congestion Avoidance. 2 Recall TCP Sliding Window Operation.
H. OhsakiITCom A control theoretical analysis of a window-based flow control mechanism for TCP connections with different propagation delays Hiroyuki.
CS 6401 Congestion Control in TCP Outline Overview of RENO TCP Reacting to Congestion SS/AIMD example.
TCP Congestion Control 컴퓨터공학과 인공지능 연구실 서 영우. TCP congestion control2 Contents 1. Introduction 2. Slow-start 3. Congestion avoidance 4. Fast retransmit.
Murari Sridharan Windows TCP/IP Networking, Microsoft Corp. (Collaborators: Kun Tan, Jingmin Song, MSRA & Qian Zhang, HKUST)
TCP transfers over high latency/bandwidth networks & Grid DT Measurements session PFLDnet February 3- 4, 2003 CERN, Geneva, Switzerland Sylvain Ravot
Recap Slow start introduced cwnd Slow start introduced cwnd Can transmit up to Can transmit up to min( cwnd, offered window ) Flow control by the sender.
An Analysis of AIMD Algorithm with Decreasing Increases Yunhong Gu, Xinwei Hong, and Robert L. Grossman National Center for Data Mining.
Karn’s Algorithm Do not use measured RTT to update SRTT and SDEV Calculate backoff RTO when a retransmission occurs Use backoff RTO for segments until.
Sandeep Kakumanu Smita Vemulapalli Gnan
Other Methods of Dealing with Congestion
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 Vegas Congestion Control Algorithm
9.6 TCP Congestion Control
Approaches towards congestion control
CUBIC Marcos Vieira.
TCP Vegas: New Techniques for Congestion Detection and Avoidance
Transport Protocols over Circuits/VCs
TCP-LP Distributed Algorithm for Low-Priority Data Transfer
Understanding Throughput & TCP Windows
TCP - Part II Relates to Lab 5. This is an extended module that covers TCP flow control, congestion control, and error control in TCP.
Congestion Control in TCP
Project-2 (20%) – DiffServ and TCP Congestion Control
TCP flow and congestion control
TCP: Transmission Control Protocol Part II : Protocol Mechanisms
Review of Internet Protocols Transport Layer
Presentation transcript:

Increasing TCP's CWND based on Throughput draft-you-iccrg-throughput-based-cwnd-increasing-00 Jianjie You IETF92 Dallas

Motivation Extend TCP to support higher throughput and lower response time services such as 4K video. Allow TCP to be configurable by applications, through which application could customize TCP congestion control algorithm and parameters according to the requirements. 2 IETF92 Dallas Applications OS Socket APIs TCP Stack Extend socket APIs  Allow application to convey information Improved congestion control algorithm  Applicable for 4K video transmission

Background 3 IETF92 Dallas Network Environment Target throughput = 50Mbps, RTT = 60ms, then target window size = 259MSS. Initial window = 10MSS. Assume packet loss occurs when cwnd = 130MSS. Reno TCP Reno needs 194 RTTs (about 11.64s) to reach the target throughput. Cubic TCP Reno needs 29 RTTs (about 1.74s) to reach the target throughput. Transmitting 4K video poses a great challenge to current TCP.

Increasing CWND based on Throughput 1/3 4 IETF92 Dallas Step 1: APP calculates the target throughput. Take 4K VBR as an example, TARGET_THROUGHPUT=e×BR, where e>1, is a multiplication factor. Step 2: Extend TCP socket option: setsockopt(); add a new parameter: TARGET_THROUGHPUT, which will be transferred to TCP protocol stack. Step 3: Calculate the increase factor alpha: alpha = TARGET_THROUGHPUT X RTT – cwnd Assumption: Network capacity can meet target throughput.

Increasing CWND based on Throughput 2/3 5 IETF92 Dallas The increase factor for cwnd is calculated according to RTT and TARGET_THROUGHPUT. The cwnd is adjusted for every RTT.

Increasing CWND based on Throughput 3/3 6 IETF92 Dallas  Window Growth Function: Alpha TARGET_cwnd = TARGET_THROUGHPUT X BaseRTT When cwnd reaches to TARGET_cwnd, Alpha is zero where RTT = BaseRTT T is defined to balance the congestion state of the network

7 IETF92 Dallas Implementation 1/3 Figure 5: Window Curve with Packet Loss using Proposed Method Network Environment Target throughput = 50Mbps, RTT = 60ms, then target window size = 259MSS. Initial window = 10MSS. If packet loss occurs, cwnd = ½ cwnd. Proposed Method Only one RTT is needed to reach to the target throughput during both slow start phase and congestion avoidance phase.

8 IETF92 Dallas Implementation 2/3 Figure 6: Window Curve with Packet Loss using Proposed Method Network Environment Target throughput = 50Mbps, RTT = 60ms, then target window size = 259MSS. Initial window = 10MSS. If packet loss occurs, cwnd = ½ cwnd. Proposed Method The beginning thirty MSSs are used to estimate the BaseRTT. The cwnd fluctuates a little, but it can be stabilized by the proposed method.

9 IETF92 Dallas Implementation 3/3 Figure 7: Window Curve with no Packet Loss using Proposed Method Network Environment Target throughput = 50Mbps, RTT = 60ms, then target window size = 259MSS. Initial window = 10MSS. If packet loss occurs, cwnd = ½ cwnd. Proposed Method The beginning thirty MSSs are used to estimate the BaseRTT. The cwnd is balanced around the target cwnd.

Next Step Do more experiments... Go as an experimental RFC? 10 IETF92 Dallas

Thank You! IETF92 Dallas