Impact of New CC on Cross Traffic

Slides:



Advertisements
Similar presentations
Appropriateness of Transport Mechanisms in Data Grid Middleware Rajkumar Kettimuthu 1,3, Sanjay Hegde 1,2, William Allcock 1, John Bresnahan 1 1 Mathematics.
Advertisements

IWSSC 2008 – Oct 3 rd 2008 Raffaello Secchi Scheduling TCP-Friendly Flows over a Satellite Network R. Secchi, A. Sathiaseelan, and G. Fairhurst Electronics.
RED-PD: RED with Preferential Dropping Ratul Mahajan Sally Floyd David Wetherall.
1 Specifying New Congestion Control Algorithms Sally Floyd and Mark Allman draft-floyd-cc-alt-00.txt November 2006 TSVWG Slides:
Ahmed El-Hassany CISC856: CISC 856 TCP/IP and Upper Layer Protocols Slides adopted from: Injong Rhee, Lisong Xu.
On Impact of Non-Conformant Flows on a Network of Drop-Tail Gateways Kartikeya Chandrayana Shivkumar Kalyanaraman ECSE Dept., R.P.I. (
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. March 2005, presentation to AVT draft-ietf-dccp-tfrc-voip-01.txt.
1 Equation-Based Congestion Control for Unicast Applications Sally Floyd, Mark Handley, Jitendra Padhye & Jorg Widmer August 2000, ACM SIGCOMM Computer.
Networks: Congestion Control1 Congestion Control.
Metrics for Performance Evaluation Nelson Fonseca State University of Campinas.
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 Design study for multimedia transport protocol in heterogeneous networks Haitao Wu; Qian Zhang; Wenwu Zhu; Communications, ICC '03. IEEE International.
Promoting the Use of End-to- End Congestion Control in the Internet Sally Floyd and Kevin Fall Presented by Scott McLaren.
Performance Enhancement of TFRC in Wireless Ad Hoc Networks Travis Grant – Mingzhe Li, Choong-Soo Lee, Emmanuel.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
Medium Start in TCP-Friendly Rate Control Protocol CS 217 Class Project Spring 04 Peter Leong & Michael Welch.
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
Reducing Flow-Completion Time for Small Flows by Modifying Slow-Start Affan Rauf ( )
Changes in CCID 2 and CCID 3 Sally Floyd August 2004 IETF.
POSTECH DP&NM Lab. Internet Traffic Monitoring and Analysis: Methods and Applications (1) 2. Network Monitoring Metrics.
TFRC: TCP Friendly Rate Control using TCP Equation Based Congestion Model CS 218 W 2003 Oct 29, 2003.
Adding Explicit Congestion Notification (ECN) Capability to TCP's SYN/ACK Packets A. Kuzmanovic, A. Mondal, S. Floyd, and K.K. Ramakrishnan draft-ietf-tcpm-ecnsyn-03.txt.
Datagram Congestion Control Protocol
U Innsbruck Informatik - 1 CADPC/PTP in a nutshell Michael Welzl
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. August 2005 draft-ietf-dccp-tfrc-voip-02.txt Slides:
1 Standardizing New Congestion Control Algorithms Sally Floyd Workshop on High-speed TCP Microsoft February 5-6, 2007 Slides:
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. November 2005 draft-ietf-dccp-tfrc-voip-02.txt Slides:
Byte and Packet Congestion Notification draft-briscoe-tsvwg-byte-pkt-mark-00.txt draft-briscoe-tsvwg-byte-pkt-mark-00.txt Bob Briscoe, BT & UCL IETF-69.
HighSpeed TCP for High Bandwidth-Delay Product Networks Raj Kettimuthu.
Requirements for Simulation and Modeling Tools Sally Floyd NSF Workshop August 2005.
Draft-welzl-rmcat-coupled-cc-01 Coupled Congestion Control for RTP Media Michael Welzl, Safiqul Islam, Stein Gjessing Networks and Distributed Systems.
Quick-Start for TCP and IP Draft-amit-quick-start-03.txt A.Jain, S. Floyd, M. Allman, and P. Sarolahti ICIR, December
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.
DCCP: Issues From the Mailing List Sally Floyd, Eddie Kohler, Mark Handley, et al. DCCP WG March 4, 2004.
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. March draft-ietf-dccp-tfrc-voip-01.txt
AQM & TCP models Courtesy of Sally Floyd with ICIR Raj Jain with OSU.
Murari Sridharan and Kun Tan (Collaborators: Jingmin Song, MSRA & Qian Zhang, HKUST.
Improving our Evaluation of Transport Protocols Sally Floyd Hamilton Institute July 29, 2005.
Promoting the Use of End-to-End Congestion Control in the Internet Sally Floyd and Kevin Fall IEEE-ACAM Transactions on Networking, 馬儀蔓.
Thoughts on the Evolution of TCP in the Internet (version 2) Sally Floyd ICIR Wednesday Lunch March 17,
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
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. November 2005 draft-ietf-dccp-tfrc-voip-05.txt Slides:
Masaki Hirabaru (NICT) and Jin Tanaka (KDDI) Impact of Bottleneck Queue on Long Distant TCP Transfer August 25, 2005 NOC-Network Engineering Session Advanced.
Dynamic Behavior of Slowly Responsive Congestion Control Algorithms (Bansal, Balakrishnan, Floyd & Shenker, 2001)
© 2006 Andreas Haeberlen, MPI-SWS 1 Monarch: A Tool to Emulate Transport Protocol Flows over the Internet at Large Andreas Haeberlen MPI-SWS / Rice University.
RFC 2861 authors: Mark Handley, Jitendra Padhye, and Sally Floyd
Chapter 6 TCP Congestion Control
TCP-LP: A Distributed Algorithm for Low Priority Data Transfer
Chapter 3 outline 3.1 Transport-layer services
TFRC for Voice: VoIP Variant and Faster Restart.
Generalizing The Network Performance Interference Problem
TCP-LP Distributed Algorithm for Low-Priority Data Transfer
HighSpeed TCP for Large Congestion Windows
Internet Congestion Control Research Group
ECE 599: Multimedia Networking Thinh Nguyen
Internet Research Needs a Critical Perspective Towards Models
AMP: A Better Multipath TCP for Data Center Networks
Adding ECN Capability to TCP’s SYN/ACK Packets
The University of Adelaide, School of Computer Science
Chapter 6 TCP Congestion Control
Quick-Start for TCP and IP
“Promoting the Use of End-to-End Congestion Control in the Internet”
TCP Throughput Modeling
Chapter 3 outline 3.1 Transport-layer services
DCCP: Issues From the Mailing List
Lecture 6, Computer Networks (198:552)
Designing a Relative Delay Estimator for Multipath Transport
Presentation transcript:

Impact of New CC on Cross Traffic S. Floyd TCP Round Table November 2007

The question: How to assess the impact of new CC on cross-traffic (web-traffic, multimedia, other long transfers using different CC).

Approaches from the literature: Look at response functions. (Sending rate as a function of packet drop rate, for a single flow with fixed RTTs.) Example: RFC 3649, HSTCP. Compare aggregate throughput of TCP flows with aggregate throughput of NewCC flows. X-axis: Number of web sessions. Scenario includes reverse-path traffic. Examples: RFC 4828, TFRC-SP, Figures 12-21. The two aggregates being compared could include both long-lived and web traffic.

Congested links with different ranges of RTTs. Look at a range of congested links: A local network (e.g., within a single institution), a transoceanic link, and a satellite link, as well as a congested link with a standard range of round-trip times. Why? To evaluate proposals where the level of aggressiveness is a function of the RTT.

Make sure there is a realistic range of connection sizes! This includes medium-size flows slow-starting up to large windows, and then terminating. This introduces typical cases of transient delay and packet drops.

Make sure that flows have staggered start times: So that some flows start out when the queue is already high from another flow slow-starting. (E.g., for delay-based congestion control.)

Some NewCC mechanisms need to be tested for fairness under a range of queue mechanisms. E.g., RFC 4828, TFRC-SP. The fairness is quite different for Drop-Tail queues in packets, Drop-Tail queues in bytes, AQM in packet mode, and AQM in byte mode.

Bandwidth stolen from TCP: Let there be two groups of flows, A and B. Case 1: Groups A and B both use TCP. Case 2: Group A uses TCP, group B uses NewCC. Compare Group A’s fraction of bandwidth in Case 1 with Group A’s fraction of the bandwidth in Case 2. The difference between the two fractions is the fraction of the bandwidth slolen from group A by the NewCC. Example: RFC 3649, HSTCP.

Approaches from the literature, for proposals for faster start-ups: Plot drop rates for regular traffic when a fraction of the traffic is using NewCC. X-axis: Number of web sessions. Example: SAF07 paper for Quick-Start. Plot flow completion times for regular traffic, with and without NewCC enabled for other traffic.

Approaches from the literature: slowly-responding CC.

A benefit of testbeds: In addition to queueing delay, testbeds might exhibit delay due to router CPU delay, delay at firewalls, etc. This would be very interesting, particularly for evaluating delay-based congestion control.

The impact on streaming media? Measure the average queueing delay, and the average packet drop rates, with and without the NewCC. Include streaming media, and look at the delay and packet drop rates experienced by those flows?

Stress-testing fairness of delay-based congestion control?