TCP Vegas Brakmo & Peterson. No change in TCP spec, merely an alternative implementation –Changes needed only at sender side Main finding –Vegas achieves.

Slides:



Advertisements
Similar presentations
TCP Variants.
Advertisements

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 LAWRENCE S. BRAKMO SEAN W. O’MALLEY LARRY L. PETERSON PRESENTED TCP VEGAS IN 1994 PRESENTED BY CHUNG TRAN.
TCP Vegas: New Techniques for Congestion Detection and Control.
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.
Congestion Control Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.
TCP Congestion Control Dina Katabi & Sam Madden nms.csail.mit.edu/~dina 6.033, Spring 2014.
Computer Networks: TCP Congestion Control 1 TCP Congestion Control Lecture material taken from “Computer Networks A Systems Approach”, Fourth Edition,Peterson.
School of Information Technologies TCP Congestion Control NETS3303/3603 Week 9.
18 Nov 2009 TCP VEGAS Mohammad AlKurbi CMPT – 771: Internet Architecture and Protocols.
TCP Variations Naveen Manicka CISC 856 – Fall 2005 Computer & Information Sciences University of Delaware Nov 10, 2005 Most slides are borrowed from J.
Transport Layer3-1 Congestion Control. Transport Layer3-2 Principles of Congestion Control Congestion: r informally: “too many sources sending too much.
1 Congestion Control Outline Queuing Discipline Reacting to Congestion Avoiding Congestion.
Computer Networks: TCP Congestion Control 1 TCP Congestion Control Lecture material taken from “Computer Networks A Systems Approach”, Third Ed.,Peterson.
High speed TCP’s. Why high-speed TCP? Suppose that the bottleneck bandwidth is 10Gbps and RTT = 200ms. Bandwidth delay product is packets (1500.
Week 9 TCP9-1 Week 9 TCP 3 outline r 3.5 Connection-oriented transport: TCP m segment structure m reliable data transfer m flow control m connection management.
TCP Congestion Control TCP sources change the sending rate by modifying the window size: Window = min {Advertised window, Congestion Window} In other words,
1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.
Computer Networks : TCP Congestion Control1 TCP Congestion Control.
1 Chapter 3 Transport Layer. 2 Chapter 3 outline 3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4.
Transport: TCP Manpreet Singh (Slides borrowed from various sources on the web)
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
Networks : TCP Congestion Control1 TCP Congestion Control.
Networks : TCP Congestion Control1 TCP Congestion Control Presented by Bob Kinicki.
Advanced Computer Networks: TCP Congestion Control 1 TCP Congestion Control Lecture material taken from “Computer Networks A Systems Approach”, Fourth.
1 K. Salah Module 6.1: TCP Flow and Congestion Control Connection establishment & Termination Flow Control Congestion Control QoS.
Error Checking continued. Network Layers in Action Each layer in the OSI Model will add header information that pertains to that specific protocol. On.
TCP: flow and congestion control. Flow Control Flow Control is a technique for speed-matching of transmitter and receiver. Flow control ensures that a.
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.
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.
TFRC: TCP Friendly Rate Control using TCP Equation Based Congestion Model CS 218 W 2003 Oct 29, 2003.
Understanding the Performance of TCP Pacing Amit Aggarwal, Stefan Savage, Thomas Anderson Department of Computer Science and Engineering University of.
Principles of Congestion Control Congestion: informally: “too many sources sending too much data too fast for network to handle” different from flow control!
TCP Vegas Kulan Kao 2006/3/25.
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.
Congestion Control (cont’d). TCP Congestion Control Review Congestion control consists of 3 tasks  Detect congestion  Adjust sending rate  Determine.
Transmission Control Protocol TCP Part 2 University of Glamorgan Networked & Distributed Systems.
Lecture 9 – More TCP & Congestion Control
What is TCP? Connection-oriented reliable transfer Stream paradigm
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP – III Reliability and Implementation Issues.
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:
TCP End-To-End Congestion Control Wanida Putthividhya Dept. of Computer Science Iowa State University Jan, 27 th 2002 (May, 25 th 2001)
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP – III Reliability and Implementation Issues.
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.
1 Computer Networks Congestion Avoidance. 2 Recall TCP Sliding Window Operation.
TCP. TCP ACK generation [RFC 1122, RFC 2581] Event at Receiver Arrival of in-order segment with expected seq #. All data up to expected seq # already.
TCP Congestion Control 컴퓨터공학과 인공지능 연구실 서 영우. TCP congestion control2 Contents 1. Introduction 2. Slow-start 3. Congestion avoidance 4. Fast retransmit.
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.
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.
Sandeep Kakumanu Smita Vemulapalli Gnan
Other Methods of Dealing with Congestion
Analysis and Comparison of TCP Reno and TCP Vegas Review
Window Control Adjust transmission rate by changing Window Size
TCP Vegas: New Techniques for Congestion Detection and Avoidance
Topics discussed in this section:
TCP Vegas: New Techniques for Congestion Detection and Avoidance
COMP 431 Internet Services & Protocols
TCP Vegas: New Techniques for Congestion Detection and Avoidance
TCP Westwood(+) Protocol Implementation in ns-3
Precept 2: TCP Congestion Control Review
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
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.
Other Methods of Dealing with Congestion
Other Methods of Dealing with Congestion
EE 122: Lecture 10 (Congestion Control)
Presentation transcript:

TCP Vegas Brakmo & Peterson

No change in TCP spec, merely an alternative implementation –Changes needed only at sender side Main finding –Vegas achieves 40-70% better throughput –Achieved this goal by more efficient use of bw rather than stealing from other flows

Three Techniques New retx mechanism Congestion Avoidance Modified Slow Start

Retx Mechanism in Reno Reno is using coarse-grained timer, 500 ms –Lower accuracy and freq to check for retx Longer retx delay –Retx when Timeout occurs 3 Duplicate acks

Retx Mech. in Vegas Extension for retx in Vegas: keep track of ts to measure accurate RTT –If measured RTT for a dup ack > timeout => retx pkt – if RTT for (1 st or 2 nd pkt after retx) non-dup ack > timeout => retx pkt –What is the Intuition for this? Idea: use arrival of an ACK to check for timeout Keep Reno’s coarse-grained retx timeout Only reduce cwn due to the losses that occured during current rate/window, i.e. lost segment was sent after last window decrease

Reactive vs pro-active Reno is reactive to congestion rather than pro-active –uses pkt loss as sign for congestion Can we design a pro-active congestion detection => to prevent congestion

Other Proactive Cong Detection Mechanisms Some signs of building congestion: –RTT increases –Increase in throughput decreases DUAL: inc similar to Reno but –Once every 2 RTT, if currRTT > Avg(min,max)RTT => cwn*(7/8) ->cwn CARD: use both RTT and cwn –Once every 2 RTT a = (Cwn_curr – Cwn_old) * (RTT_curr – RTT_old) a cwn * 7/8 -> cwn a >= 0 => cwn + 1 -> cwn Tri-S leverages flattening of throughput

Cong Avoid in Vegas Vegas uses changes in the throughput rate Idea: no of byte in transit is proportional to the expected bandwidth –Inc cwn => inc byte in transit => inc throughput Goal: Try to match sending rate with available BW => Determine/Ctrl “right” amount of “extra” bytes –Side effects of too much/little extra?

Cong Avoid in Vegas (Details) Once per RTT Expected_T = cwn/baseRTT –BaseRTT: min RTT observed Actual_T = (bytes sent between pkt & ack)/RTT Examin Diff = Expected_T - Actual_T, by definition diff >= 0 –diff newRTT -> baseRTT –0 LI of cwn in next RTT –alpha no change in cwn –beta LD of cwn in next RTT

Modified SlowStart in Vegas Reno’s exponential inc is expensive –Half the cwn might be lost, worse in higher bw Vegas exp inc cwn once every 2 RTTs –IF Expected_T – Actual_t > Threshold THEN Switch from SlowStart to Add Inc May still lose pkts during slow start –Further investigation needed

Evaluation Simulation showed the Vegas does not adversely affect Reno traffic Vegas can achieve higher throughput and lower losses –Vegas is not aggressive Under heavy load, Vegas behaves like Reno