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

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,
Advanced satellite infrastructures in future global Grid computing: network solutions to compensate delivery delay Blasco Bonito, Alberto Gotta and Raffaello.
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.
© 2007 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.1 Computer Networks and Internets with Internet Applications, 4e By Douglas.
1.  Congestion Control Congestion Control  Factors that Cause Congestion Factors that Cause Congestion  Congestion Control vs Flow Control Congestion.
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.
CS640: Introduction to Computer Networks Mozafar Bag-Mohammadi Lecture 3 TCP Congestion Control.
Practice Questions: Congestion Control and Queuing
Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.
Congestion control principles Presentation by: Farhad Rad (Advanced computer Networks Lesson in
TCP Stability and Resource Allocation: Part II. Issues with TCP Round-trip bias Instability under large bandwidth-delay product Transient performance.
Dynamic Internet Congestion with Bursts Stefan Schmid Roger Wattenhofer Distributed Computing Group, ETH Zurich 13th International Conference On High Performance.
Metrics for Performance Evaluation Nelson Fonseca State University of Campinas.
1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.
Promoting the Use of End-to- End Congestion Control in the Internet Sally Floyd and Kevin Fall Presented by Scott McLaren.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
Data Communication and Networks
Efficient Internet Traffic Delivery over Wireless Networks Sandhya Sumathy.
Reliable Transport Layers in Wireless Networks Mark Perillo Electrical and Computer Engineering.
1 K. Salah Module 6.1: TCP Flow and Congestion Control Connection establishment & Termination Flow Control Congestion Control QoS.
TCP Congestion Control
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
Proxy-based TCP over mobile nets1 Proxy-based TCP-friendly streaming over mobile networks Frank Hartung Uwe Horn Markus Kampmann Presented by Rob Elkind.
Ns Simulation Final presentation Stella Pantofel Igor Berman Michael Halperin
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.
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.
Chapter 12 Transmission Control Protocol (TCP)
Computer Networks with Internet Technology William Stallings
TCP Trunking: Design, Implementation and Performance H.T. Kung and S. Y. Wang.
Chapter 24 Transport Control Protocol (TCP) Layer 4 protocol Responsible for reliable end-to-end transmission Provides illusion of reliable network to.
1 Capacity Dimensioning Based on Traffic Measurement in the Internet Kazumine Osaka University Shingo Ata (Osaka City Univ.)
Promoting the Use of End-to-End Congestion Control in the Internet Sally Floyd and Kevin Fall IEEE-ACAM Transactions on Networking, 馬儀蔓.
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP – III Reliability and Implementation Issues.
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.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
PCP: Efficient Endpoint Congestion Control NSDI, 2006 Thomas Anderson, Andrew Collins, Arvind Krishnamurthy and John Zahorjan University of Washington.
Internet Connectivity and Performance for the HEP Community. Presented at HEPNT-HEPiX, October 6, 1999 by Warren Matthews Funded by DOE/MICS Internet End-to-end.
Queuing Delay 1. Access Delay Some protocols require a sender to “gain access” to the channel –The channel is shared and some time is used trying to determine.
An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.
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.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
PathChirp Efficient Available Bandwidth Estimation Vinay Ribeiro Rice University Rolf Riedi Rich Baraniuk.
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP Congestion Control.
An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.
Transmission Control Protocol (TCP) TCP Flow Control and Congestion Control CS 60008: Internet Architecture and Protocols Department of CSE, IIT Kharagpur.
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
Topics discussed in this section:
COMP 431 Internet Services & Protocols
Congestion control principles
Congestion Control, Internet transport protocols: udp
CONGESTION CONTROL.
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.
COMP/ELEC 429/556 Fall 2017 Homework #2
TCP Congestion Control
TCP Overview.
Presentation transcript:

PCP: Efficient Endpoint Congestion Control To appear in NSDI, 2006 Thomas Anderson, Andrew Collins, Arvind Krishnamurthy and John Zahorjan University of Washington Presented by Karl Deng April 11, 2006

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

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 the 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

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

Conclusion 1. Minimize transfer time  Direct Jump - Probe: detect whether the network can currently support a test rate - Probe control: how to vary the test rates? - Using history: achieves constant startup time 2. Negligible packet loss & low queue variability  Rate compensation - Monitor the gap and one-way delays of baseline packets - Infer the queuing status and reduce base rate.