TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. March 2005 draft-ietf-dccp-tfrc-voip-01.txt

Slides:



Advertisements
Similar presentations
ELECTRONICS RESEARCH GROUP DEPARTMENT OF ENGINEERING IETF-68, March 19-23, 2007 Quick-Start for DCCP draft-fairhurst-tsvwg-dccp-qs-00 (Individual Submission)
Advertisements

RED-PD: RED with Preferential Dropping Ratul Mahajan Sally Floyd David Wetherall.
Md. Manzoor MurshedAdaptive RED with Dynamic Threshold Adjustment CprE599: Creative Component Adaptive RED with Dynamic Threshold Adjustment.
Presentation by Joe Szymanski For Upper Layer Protocols May 18, 2015.
Simulating Large Networks using Fluid Flow Model Yong Liu Joint work with Francesco LoPresti, Vishal Misra Don Towsley, Yu Gu.
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. March 2005, presentation to AVT draft-ietf-dccp-tfrc-voip-01.txt.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
1 Estimating Shared Congestion Among Internet Paths Weidong Cui, Sridhar Machiraju Randy H. Katz, Ion Stoica Electrical Engineering and Computer Science.
Advanced Computer Networks: RED 1 Random Early Detection Gateways for Congestion Avoidance * Sally Floyd and Van Jacobson, IEEE Transactions on Networking,
1 Equation-Based Congestion Control for Unicast Applications Sally Floyd, Mark Handley, Jitendra Padhye & Jorg Widmer August 2000, ACM SIGCOMM Computer.
Active Queue Management. Fundamental problem: Queues and TCP Queues –Queues are to absorb bursts of packets. –They are required for statistical multiplexing.
High speed TCP’s. Why high-speed TCP? Suppose that the bottleneck bandwidth is 10Gbps and RTT = 200ms. Bandwidth delay product is packets (1500.
EE689 Lecture 5 Review of last lecture More on HPF RED.
1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug 1993), pp
Computer Networks : TCP Congestion Control1 TCP Congestion Control.
A Real-Time Video Multicast Architecture for Assured Forwarding Services Ashraf Matrawy, Ioannis Lambadaris IEEE TRANSACTIONS ON MULTIMEDIA, AUGUST 2005.
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.
Medium Start in TCP-Friendly Rate Control Protocol CS 217 Class Project Spring 04 Peter Leong & Michael Welch.
Random Early Detection Gateways for Congestion Avoidance
Promoting the Use of End-to-End Congestion Control & Random Early Detection of Network Congestion.
1 A State Feedback Control Approach to Stabilizing Queues for ECN- Enabled TCP Connections Yuan Gao and Jennifer Hou IEEE INFOCOM 2003, San Francisco,
Advanced Computer Networks : RED 1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking,
MulTFRC: TFRC with weighted fairness draft-welzl-multfrc-00 Michael Welzl, Dragana Damjanovic 75th IETF Meeting Stockholm, Sweden 29 July 2009.
A Simulation of Adaptive Packet Size in TCP Congestion Control Zohreh Jabbari.
Changes in CCID 2 and CCID 3 Sally Floyd August 2004 IETF.
TCP Friendly Rate Control (TFRC): Protocol Specification RFC3448bis draft-ietf-dccp-rfc3448bis-02.txt S. Floyd, M. Handley, J. Padhye, and J. Widmer Testing.
TCP and SCTP RTO Restart draft-hurtig-tcpm-rtorestart-03 Michael Welzl 1 TCPM, 85 th IETF Meeting
1 Queue Management Hamed Khanmirza Principles of Networking University of Tehran.
B 李奕德.  Abstract  Intro  ECN in DCTCP  TDCTCP  Performance evaluation  conclusion.
Datagram Congestion Control Protocol
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
Congestion Control - Supplementary Slides are adapted on Jean Walrand’s Slides.
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. August 2005 draft-ietf-dccp-tfrc-voip-02.txt Slides:
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
TCP and SCTP RTO Restart draft-hurtig-tcpm-rtorestart-02 Michael Welzl 1.
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:
Requirements for Simulation and Modeling Tools Sally Floyd NSF Workshop August 2005.
Queueing and Active Queue Management Aditya Akella 02/26/2007.
The Impact of Active Queue Management on Multimedia Congestion Control Wu-chi Feng Ohio State University.
15744 Course Project1 Evaluation of Queue Management Algorithms Ningning Hu, Liu Ren, Jichuan Chang 30 April 2001.
MulTFRC: TFRC with weighted fairness draft-welzl-multfrc-01 Michael Welzl, Dragana Damjanovic 76th IETF Meeting Hiroshima, Japan 10 November2009.
DCCP: Issues From the Mailing List Sally Floyd, Eddie Kohler, Mark Handley, et al. DCCP WG March 4, 2004.
AQM & TCP models Courtesy of Sally Floyd with ICIR Raj Jain with OSU.
Improving our Evaluation of Transport Protocols Sally Floyd Hamilton Institute July 29, 2005.
TCP: Transmission Control Protocol Part II : Protocol Mechanisms Computer Network System Sirak Kaewjamnong Semester 1st, 2004.
Thoughts on the Evolution of TCP in the Internet (version 2) Sally Floyd ICIR Wednesday Lunch March 17,
Internet research Needs Better Models Sally Floyd, Eddie Kohler ISCI Center for Internet Research, Berkeley, California Presented by Max Podlesny.
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. November 2006 draft-ietf-dccp-tfrc-voip-06.txt DCCP Working Group, IETF Slides:
Thoughts on the Evolution of TCP in the Internet Sally Floyd PFLDnet 2004 February 16, 2004.
ECEN 619, Internet Protocols and Modeling Prof. Xi Zhang Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions.
TCP Friendly Rate Control (TFRC): Protocol Specification RFC3448bis draft-ietf-dccp-rfc3448bis-03.txt S. Floyd, M. Handley, J. Padhye, and J. Widmer Testing.
Congestion Avoidance Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. November 2005 draft-ietf-dccp-tfrc-voip-05.txt Slides:
Profile for DCCP Congestion Control ID 4: the Small-Packet Variant of TFRC Congestion Control draft-floyd-ccid4-00.txt Sally Floyd and Eddie Kohler July.
Probabilistic Congestion Control for Non-Adaptable Flows Jörg Widmer, Martin Mauve, Jan Peter Damm (NOSSDAV’02) Presented by Ankur Upadhyaya for CPSC 538A.
Impact of New CC on Cross Traffic
On Queuing, Marking, and Dropping
TFRC for Voice: VoIP Variant and Faster Restart.
ECE 599: Multimedia Networking Thinh Nguyen
TCP Friendly Rate Control (TFRC): Protocol Specification RFC3448bis
Chapter 6 TCP Congestion Control
COS 461: Computer Networks
Sally Floyd and Eddie Kohler draft-floyd-ccid4-00.txt November 2006
TCP Congestion Control
Sally Floyd and Eddie Kohler draft-floyd-ccid4-01.txt July 2007
TCP Friendly Rate Control (TFRC): Protocol Specification RFC3448bis
DCCP: Issues From the Mailing List
Presentation transcript:

TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. March draft-ietf-dccp-tfrc-voip-01.txt

First, four repeat viewgraphs from last IETF…

VoIP: fairness in Bps. Standard TFRC has the goal of fairness in pps with TCP flows using the same packet size. The VoIP variant of TFRC has the goal of fairness in Bps with TCP flows using 1500-byte packets, (following RFC 3714). The VoIP variant assumes optimistically that the network limitation is in Bps, not in pps.

VoIP: fairness in Bps. In the TCP throughput equation, use the measured loss event rate and a packet size of 1460 bytes. Reduce the allowed transmit rate to account for the fraction of the VoIP bandwidth that would be used by 40-byte headers: – X <- X * TruePktSize/(TruePktSize + Header) TruePktSize = average segment size in bytes Header = 40 bytes Enforce a Min Interval between packets of 10 ms.

Measuring Congestion: The VoIP variant of TFRC uses the loss event rate. –RFC 3714 uses the packet drop rate. These are both affected by packet size and by the smoothness of the sending rate. The effect of packet size on the packet drop rate could use more investigation.

The VoIP variant of TFRC: As it stands now, it sometimes favors the VoIP TFRC flow over the large-packet TCP flow. This needs to be quantified and evaluated.

Changes from draft-ietf-dccp-tfrc-voip-00.txt: Added more simulations. Added a Related Work section.

Small Packets, Standard TFRC: The problem: –TCP flows with 1460-byte packets, competing against: –Standard TFRC flows with 200-byte packets, 10 ms between packets (e.g., 160 Kbps)

Small Packets, Standard TFRC:

Simulations with VoIP TFRC: The algorithm so far in the draft: –TCP flows with 1460 bytes, competing against –VoIP TFRC flows with 200-byte packets.

Simulations with VoIP TFRC: Table 1 from draft-ietf-dccp-tfrc-voip-01.txt.

This won’t do. The problem [Widmer, Boutremans, and Le Boudec, 2004; Vasallo 2000]: –TCP and TFRC can’t send multiple packets per RTT in the face of high congestion; VoIP TFRC can. –The loss event rate used by TFRC follows TCP by responding to at most one loss per RTT. –When TCP has one “loss event” for every two byte packets, a rate-equivalent TFRC VoIP might have one “loss event” for every byte packets. –So the “loss event rates” computed by VoIP TFRC can be too low in times of high congestion. One solution: –Loss rates have to be calculated differently, at least in times of high loss.

Solutions: Previously-explored solutions [WBB04]: –Count virtual packets [V00]. –Do random sampling of arriving packets. –Shorten part of the Loss Interval. One possible solution for VoIP TFRC: –For short loss intervals (at most two RTTs), count the actual packet loss rate (but don’t increase the number of loss intervals). –Somewhat like “random sampling” above, but only for short loss intervals. –Examples: “./test-all-friendly HighLossShort” and “./test-all-friendly printLossesShort” in tcl/test in NS.

The Modified TFRC VoIP:

Issues remaining: More exploration needs to be done. There were two problems: –VoIP TFRC can send many packets in one RTT, even in the face of heavy congestion. Taken care of. –VoIP TFRC, with small packets, sees different packet drops that it would have with larger packets. When is this a problem? For simulations with RED in byte mode (where small packets are less likely to be dropped than large packets): – Even the modified VoIP TFRC gets much more than its share of the bandwidth in times of high congestion. –Under investigation.

Assumptions: The sender doesn’t know the packet- marking mechanisms used by the routers. –E.g., Drop-Tail? Queue in bytes or in packets? AQM in byte mode or in packet mode? The sender can’t assume that packets or bytes are being dropped with some relatively stable dropping probability p. –This is not necessarily the case.

Assumptions: The number of packets dropped in one round-trip time is not necessarily an indication of the level of congestion.

Extra Viewgraphs:

Measuring Congestion: Packet size in a Drop-Tail world: –Queue measured in bytes, packets, or in-between? –Smooth or bursty sending rates? –High or low levels of statistical multiplexing? RED in packet mode: –Same packet drop rate for big and small packets. –TFRC measures the loss interval in packets. RED in byte mode: –Same byte drop rate for big and small packets.

The state of TFRC in NS: Includes the VoIP variant. Includes RFC 3390 initial sending rates. More updating is needed. –Add RFC 3390 sending rates after idle periods. –Add Faster Restart. –Add overhead for packet headers.