TCP: Reno vs Cubic Matt Kane, Ryan Chu.

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

TCP Variants.
Simulation-based Comparison of Tahoe, Reno, and SACK TCP Kevin Fall & Sally Floyd Presented: Heather Heiman September 10, 2002.
Different TCP Flavors CSCI 780, Fall TCP Congestion Control Slow-start Congestion Avoidance Congestion Recovery Tahoe, Reno, New-Reno SACK.
Congestion Control Algorithms: Open Questions Benno Overeinder NLnet Labs.
CSE534 – Fundamentals of Computer Networks Lecture 8-9: Transport (UDP, but mostly TCP) Based on slides by D. Choffnes Northeastern U Revised by P. Gill.
TCP Congestion Control Dina Katabi & Sam Madden nms.csail.mit.edu/~dina 6.033, Spring 2014.
EE 122: Congestion Control The Sequel October 1, 2003.
Computer Networks: TCP Congestion Control 1 TCP Congestion Control Lecture material taken from “Computer Networks A Systems Approach”, Fourth Edition,Peterson.
CUBIC Qian HE (Steve) CS 577 – Prof. Bob Kinicki.
School of Information Technologies TCP Congestion Control NETS3303/3603 Week 9.
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.
Congestion Control Tanenbaum 5.3, /12/2015Congestion Control (A Loss Based Technique: TCP)2 What? Why? Congestion occurs when –there is no reservation.
Computer Networks: TCP Congestion Control 1 TCP Congestion Control Lecture material taken from “Computer Networks A Systems Approach”, Third Ed.,Peterson.
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168) Limited Transmit (RFC 3042)
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.
1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.
Congestion Avoidance and Control Van Jacobson Jonghyun Kim April 1, 2004.
Computer Networks : TCP Congestion Control1 TCP Congestion Control.
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168)
1 Internet Networking Spring 2006 Tutorial 10 The Eifel Detection Algorithm for TCP RFC 3522.
1 Internet Networking Spring 2004 Tutorial 10 TCP NewReno.
Networks : TCP Congestion Control1 TCP Congestion Control.
Networks : TCP Congestion Control1 TCP Congestion Control Presented by Bob Kinicki.
TCP in Heterogeneous Network Md. Ehtesamul Haque # P.
Advanced Computer Networks: TCP Congestion Control 1 TCP Congestion Control Lecture material taken from “Computer Networks A Systems Approach”, Fourth.
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.
TCP: flow and congestion control. Flow Control Flow Control is a technique for speed-matching of transmitter and receiver. Flow control ensures that a.
3: Transport Layer3b-1 Principles of Congestion Control Congestion: r informally: “too many sources sending too much data too fast for network to handle”
Transport Layer 4 2: Transport Layer 4.
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.
TCP Vegas Kulan Kao 2006/3/25.
HighSpeed TCP for High Bandwidth-Delay Product Networks Raj Kettimuthu.
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
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.
1 CS 4396 Computer Networks Lab TCP – Part II. 2 Flow Control Congestion Control Retransmission Timeout TCP:
TCP Congestion Control Computer Networks TCP Congestion Control 1.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
David Wetherall Professor of Computer Science & Engineering Introduction to Computer Networks Fairness of Bandwidth Allocation (§6.3.1)
VO2-MAGAZINE.jpg Michael Jenkins Presents:
1 Computer Networks Congestion Avoidance. 2 Recall TCP Sliding Window Operation.
Winter 2003CS244a Handout 71 CS492B Project #2 TCP Tutorial # Jin Hyun Ju.
Internet Networking recitation #11
Computer Networks Lecture 10: Transport layer Part III
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.
Peer-to-Peer Networks 13 Internet – The Underlay Network
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.
Window Control Adjust transmission rate by changing Window Size
13. TCP Flow Control and Congestion Control – Part 2
Internet Networking recitation #9
TCP Vegas Congestion Control Algorithm
Approaches towards congestion control
CUBIC Marcos Vieira.
Chapter 6 TCP Congestion Control
COMP 431 Internet Services & Protocols
Introduction to Congestion Control
Understanding Throughput & TCP Windows
Precept 2: TCP Congestion Control Review
So far, On the networking side, we looked at mechanisms to links hosts using direct linked networks and then forming a network of these networks. We introduced.
Internet Networking recitation #10
TCP Throughput Modeling
TCP Congestion Control
EE 122: Congestion Control The Sequel
Computer Science Division
Presentation transcript:

TCP: Reno vs Cubic Matt Kane, Ryan Chu

Agenda Brief history of congestion control reno cubic Experiment description Results

Reno In the late 80s, the internet suffered major performance issues caused by high volume of packets being sent after a certain amount of packets offered to the network, the amount of goodput (useful packets) dropped dramatically One internet backbone dropped from 32kbits/s to 40 bits/s Van Jacobson is said to have saved the internet from congestion collapse Introduced congestion control principles in TCP Tahoe/Reno (1988-1990) ie congestion window Upon receiving 3 duplicate ACKS, Reno halves the congestion window, sets the slow-start threshold to the new cwnd, perform fast retransmit, entering fast recovery phase.

Cubic Derived from BIC BIC was more aggressive BIC was more complex BIC was not as TCP fair/friendly TCP congestion-control algorithm for high bandwidth networks with high latency The congestion window is a cubic function of time since the last congestion event

Reno vs Cubic

Experiment Upload a large file (multiple GBs) using both reno and cubic and measure the throughput. Which will have a higher throughput? Initial thought: cubic

Linux congestion control Find out and modify Linux congestion control: /proc/sys/net/ipv4/tcp_available_congestion_control shows all congestion control algorithms that can be used cubic reno /proc/sys/net/ipv4/tcp_congestion_control shows CURRENT congestion control algorithm to change, write “cubic” or “reno” cubic is default from version 2.6.19 NOTE: need root permission to change

Linux congestion control Changing TCP congestion control Method 1: setsockopt() Method 2: iperf -Z reno -Z cubic #include <netinet/tcp.h> ... if (setsockopt(msgsock, IPPROTO_TCP, TCP_CONGESTION, optval, optlen) < 0) { perror("setsockopt"); return 1; }

Results Using setsockopt() Trouble sending more than 1.4GB results were inconsistent

Results Using iperf

Discussion Why was there no difference in throughput? Ideas: Is iperf actually changing the congestion control algorithm? Network is not fast enough for cubic to make a difference max out ~100 MB/sec

Questions