PCP: Efficient Endpoint Congestion Control NSDI, 2006 Thomas Anderson, Andrew Collins, Arvind Krishnamurthy and John Zahorjan University of Washington.

Slides:



Advertisements
Similar presentations
Martin Suchara, Ryan Witt, Bartek Wydrowski California Institute of Technology Pasadena, U.S.A. TCP MaxNet Implementation and Experiments on the WAN in.
Advertisements

Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Internet Measurement Conference 2003 Source-Level IP Packet Bursts: Causes and Effects Hao Jiang Constantinos Dovrolis (hjiang,
CS 4700 / CS 5700 Network Fundamentals
1 CONGESTION CONTROL. 2 Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because.
CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
 Liang Guo  Ibrahim Matta  Computer Science Department  Boston University  Presented by:  Chris Gianfrancesco and Rick Skowyra.
1.  Congestion Control Congestion Control  Factors that Cause Congestion Factors that Cause Congestion  Congestion Control vs Flow Control Congestion.
PCP a Savior or a Saboteur? Presented by: Ao-Jan Su.
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.
CS 268: Lecture 7 (Beyond TCP Congestion Control) Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences University.
Router-assisted congestion control Lecture 8 CS 653, Fall 2010.
Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.
Congestion Control An Overview -Jyothi Guntaka. Congestion  What is congestion ?  The aggregate demand for network resources exceeds the available capacity.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
One More Bit Is Enough Yong Xia, RPI Lakshminarayanan Subramanian, UCB Ion Stoica, UCB Shivkumar Kalyanaraman, RPI SIGCOMM’05, August 22-26, 2005, Philadelphia,
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
Networks: Congestion Control1 Congestion Control.
High speed TCP’s. Why high-speed TCP? Suppose that the bottleneck bandwidth is 10Gbps and RTT = 200ms. Bandwidth delay product is packets (1500.
1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168)
Promoting the Use of End-to- End Congestion Control in the Internet Sally Floyd and Kevin Fall Presented by Scott McLaren.
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.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
Data Communication and Networks
ACN: Congestion Control1 Congestion Control and Resource Allocation.
TCP Congestion Control
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
Ns Simulation Final presentation Stella Pantofel Igor Berman Michael Halperin
PCP: Efficient Endpoint Congestion Control To appear in NSDI, 2006 Thomas Anderson, Andrew Collins, Arvind Krishnamurthy and John Zahorjan University of.
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.
1 Robust Transport Protocol for Dynamic High-Speed Networks: enhancing XCP approach Dino M. Lopez Pacheco INRIA RESO/LIP, ENS of Lyon, France Congduc Pham.
POSTECH DP&NM Lab. Internet Traffic Monitoring and Analysis: Methods and Applications (1) 2. Network Monitoring Metrics.
1 MaxNet and TCP Reno/RED on mice traffic Khoa Truong Phan Ho Chi Minh city University of Technology (HCMUT)
CONGESTION CONTROL and RESOURCE ALLOCATION. Definition Resource Allocation : Process by which network elements try to meet the competing demands that.
Understanding the Performance of TCP Pacing Amit Aggarwal, Stefan Savage, Thomas Anderson Department of Computer Science and Engineering University of.
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
MaxNet NetLab Presentation Hailey Lam Outline MaxNet as an alternative to TCP Linux implementation of MaxNet Demonstration of fairness, quick.
Computer Networks with Internet Technology William Stallings
High-speed TCP  FAST TCP: motivation, architecture, algorithms, performance (by Cheng Jin, David X. Wei and Steven H. Low)  Modifying TCP's Congestion.
Contents Causes and cost of congestion Three examples How to handle congestion End-to-end Network-assisted TCP congestion control ATM ABR congestion control.
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP – III Reliability and Implementation Issues.
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.
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP – III Reliability and Implementation Issues.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429/556 Introduction to Computer Networks Principles of Congestion Control Some slides.
By N.Gopinath AP/CSE Unit: III Introduction to Transport layer.
Thoughts on the Evolution of TCP in the Internet (version 2) Sally Floyd ICIR Wednesday Lunch March 17,
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science
Internet Measurement and Analysis Vinay Ribeiro Shriram Sarvotham Rolf Riedi Richard Baraniuk Rice University.
TeXCP: Protecting Providers’ Networks from Unexpected Failures & Traffic Spikes Dina Katabi MIT - CSAIL nms.csail.mit.edu/~dina.
Analysis and Design of an Adaptive Virtual Queue (AVQ) Algorithm for AQM By Srisankar Kunniyur & R. Srikant Presented by Hareesh Pattipati.
Spring Computer Networks1 Congestion Control Sections 6.1 – 6.4 Outline Preliminaries Queuing Discipline Reacting to Congestion Avoiding Congestion.
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP Congestion Control.
Access Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla Computer Science Department, University of.
Dynamic Behavior of Slowly Responsive Congestion Control Algorithms (Bansal, Balakrishnan, Floyd & Shenker, 2001)
Congestion Control in Data Networks and Internets
Johns Hopkins university
CS 268: Lecture 6 Scott Shenker and Ion Stoica
TCP Congestion Control
CONGESTION CONTROL.
TCP, XCP and Fair Queueing
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.
April 10, 2006, Northwestern University
TCP Congestion Control
TCP Overview.
Presentation transcript:

PCP: Efficient Endpoint Congestion Control NSDI, 2006 Thomas Anderson, Andrew Collins, Arvind Krishnamurthy and John Zahorjan University of Washington Presented by Aleksandar Kuzmanovic September 30, 2009

PCP -- Probe Control Protocol  Probe  Detect whether the network can currently support a test rate  End-to-end approach  Emulates network-based control  “Request and Set” Overview

Background TCP, Vegas, RAP, Fast TCP, S-TCP High Speed TCP DecBit, ECN, RED, AQM PCP ATM, XCP, WFQ, RCP End PointRouter Support Try and Backoff Request and Set

1. Minimize transfer time 2. Negligible packet loss & low queue variability 3. Resources are fully allocated if there is sufficient demand 4. Fairness 5. Stable system even under high loads Design Goals

1. Minimize transfer time Design Goals Common Case -- Most network paths are idle most of the time.  Most transfers are relatively short  Startup efficiency is particularly important.  TCP congestion control was designed at a time when links were thin and usually fully utilized  Efficiency loss of slow start is minimal

2.Negligible packet loss & low queue variability Design Goals  Packet loss: Queue overflow  Can we prevent queues from overflow ?  Large queuing delays unnecessarily delay interactive response time and disrupt real-time traffic.  Can we eliminate queues that might build up at routers?

1. Minimize transfer time 2. Negligible packet loss & low queue variability 3. Resources are fully allocated if there is sufficient demand 4. Fairness 5. Stable system even under high loads Design Goals Goals of PCP: Achieves rapid startup, small queues, and low loss rates, and that it does not compromise eventual efficiency, fairness and stability.

 Moderate sized flows on idle links  Interactive applications  Applications demanding minimally variable response times TCP managed networks perform poorly for these applications! Application Examples

 Test a target rate by sending a short probe.  Given a successful test, senders immediately increase their base rate by the target rate of the probe.  Two important techniques: Probe control: how to vary the test rates? Using history: achieves constant startup time Goal 1. Minimize transfer time  Direct Jump

Exponential increase and decrease  Start with a baseline rate: One maximum sized packet per round-trip.  Double the attempted rate increase after each successful probe.  Halve the attempted rate increase after each unsuccessful probe. Probe Control Time Rate Probe Channel Capacity Probe Direct Jump

 Send packet train spaced at an interval to achieve desired rate -- Currently, five packets whose size could be varied  Check for queuing delays based on reception times Probes

Using History Keep history information about the base rates previously used to each Internet address Set the initial probe rate based on previous base rate. Allows the end host to usually identify the optimal rate within two round trip times. Direct Jump

Goal 2. Negligible packet loss & low queue variability  Rate compensation Eliminate queues at routers:  Notice queue-buildups: Reduce the sending rate by a factor of (Δout – Δin ) /Δout  Detect persistent queueing: Reduce the sending rate by a factor of (max-delay – min-delay) / max-delay

 Transmit the baseline packets in a paced manner (equally spaced) at the base rate.  Monitor the gap between baseline PCP packets Δin -- gap used by the sender Δout -- gap observed at the receiver  Monitor the one-way delays of baseline PCP packets max-delay -- maximum one-way delay (maxdelay) observed in the previous round trip time min-delay -- minimum observed one-way delay (will time out) Baseline Packets

 Send packet train spaced at an interval to achieve desired rate -- Currently, five packets whose size could be varied  Check for queuing delays based on reception times Probes

Both are paced packets. Probes: short, high-rate bursts (sent at a test rate) Baseline packets: regular data traffic (sent at the base rate) Impact of a Probe is independent of its test rate. Easy to test aggressively without fear of disrupting existing connections. Comparison of Baseline Packets & Probes Time Rate Probe Channel Capacity Probe

 User-level implementation: Response time improves by a factor of 2 over TCP Better performance for long transfers as well  Simulation Smaller response times, smaller queue sizes PCP is compatible and benefits from fair queuing in the network Evaluation

Conclusion Emulating ‘request and set’ approach from the endpoints is possible The key idea is to send short probes: - impact of a probe is independent of its test rate - easy to test aggressively Achieves negligible packet loss & low queue variability Superior start-up behavior Effective over FQ routers