Medium Start in TCP-Friendly Rate Control Protocol CS 217 Class Project Spring 04 Peter Leong & Michael Welch.

Slides:



Advertisements
Similar presentations
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Advertisements

Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Transport Layer3-1 TCP AIMD multiplicative decrease: cut CongWin in half after loss event additive increase: increase CongWin by 1 MSS every RTT in the.
1 TCP Congestion Control. 2 TCP Segment Structure source port # dest port # 32 bits application data (variable length) sequence number acknowledgement.
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.
Restricted Slow-Start for TCP William Allcock 1,2, Sanjay Hegde 3 and Rajkumar Kettimuthu 1,2 1 Argonne National Laboratory 2 The University of Chicago.
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. March 2005, presentation to AVT draft-ietf-dccp-tfrc-voip-01.txt.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
1 Equation-Based Congestion Control for Unicast Applications Sally Floyd, Mark Handley, Jitendra Padhye & Jorg Widmer August 2000, ACM SIGCOMM Computer.
Transport Layer 3-1 outline r TCP m segment structure m reliable data transfer m flow control m congestion control.
Transport Layer 3-1 Fast Retransmit r time-out period often relatively long: m long delay before resending lost packet r detect lost segments via duplicate.
Transport Layer 3-1 Outline r TCP m Congestion control m Flow control.
High-performance bulk data transfers with TCP Matei Ripeanu University of Chicago.
1 Design study for multimedia transport protocol in heterogeneous networks Haitao Wu; Qian Zhang; Wenwu Zhu; Communications, ICC '03. IEEE International.
TCP Friendliness CMPT771 Spring 2008 Michael Jia.
Performance Enhancement of TFRC in Wireless Ad Hoc Networks Travis Grant – Mingzhe Li, Choong-Soo Lee, Emmanuel.
Data Communication and Networks
1 ATP: A Reliable Transport Protocol for Ad-hoc Networks Sundaresan, Anantharam, Hseih, Sivakumar.
1 K. Salah Module 6.1: TCP Flow and Congestion Control Connection establishment & Termination Flow Control Congestion Control QoS.
CPSC 538A1 Dynamic Behavior of Slowly- Responsive Congestion Control Algorithms Deepak Bansal, Hari BalaKrishna, Sally Floyd and Scott Shenker Presented.
CS :: Fall 2003 TCP Friendly Streaming Ketan Mayer-Patel.
Proxy-based TCP over mobile nets1 Proxy-based TCP-friendly streaming over mobile networks Frank Hartung Uwe Horn Markus Kampmann Presented by Rob Elkind.
Receiver-driven Layered Multicast Paper by- Steven McCanne, Van Jacobson and Martin Vetterli – ACM SIGCOMM 1996 Presented By – Manoj Sivakumar.
3: Transport Layer3b-1 Principles of Congestion Control Congestion: r informally: “too many sources sending too much data too fast for network to handle”
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.
Congestion control for multimedia Henning Schulzrinne Dept. of Computer Science Columbia University Fall 2003.
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.
Qian Zhang Department of Computer Science HKUST Advanced Topics in Next- Generation Wireless Networks Transport Protocols in Ad hoc Networks.
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.
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.
Datagram Congestion Control Protocol
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.
HighSpeed TCP for High Bandwidth-Delay Product Networks Raj Kettimuthu.
TCP Trunking: Design, Implementation and Performance H.T. Kung and S. Y. Wang.
Datagram Congestion Control Protocol (DCCP) CISC TCP/IP and Upper Layer Protocols Presentation by Xiaofeng Han Thanks for Kireeti.
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
What is TCP? Connection-oriented reliable transfer Stream paradigm
Transport Layer 3-1 Chapter 3 Transport Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March
1 Transport Layer Lecture 10 Imran Ahmed University of Management & Technology.
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.
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.
Transport Layer 3- Midterm score distribution. Transport Layer 3- TCP congestion control: additive increase, multiplicative decrease Approach: increase.
TCP OVER ADHOC NETWORK. TCP Basics TCP (Transmission Control Protocol) was designed to provide reliable end-to-end delivery of data over unreliable networks.
TCP Congestion Control 컴퓨터공학과 인공지능 연구실 서 영우. TCP congestion control2 Contents 1. Introduction 2. Slow-start 3. Congestion avoidance 4. Fast retransmit.
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.
TCP Friendly Rate Control (TFRC): Protocol Specification RFC3448bis draft-ietf-dccp-rfc3448bis-03.txt S. Floyd, M. Handley, J. Padhye, and J. Widmer Testing.
TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. November 2005 draft-ietf-dccp-tfrc-voip-05.txt Slides:
Access Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla Computer Science Department, University of.
@Yuan Xue A special acknowledge goes to J.F Kurose and K.W. Ross Some of the slides used in this lecture are adapted from their.
Dynamic Behavior of Slowly Responsive Congestion Control Algorithms (Bansal, Balakrishnan, Floyd & Shenker, 2001)
@Yuan Xue A special acknowledge goes to J.F Kurose and K.W. Ross Some of the slides used in this lecture are adapted from their.
Window Control Adjust transmission rate by changing Window Size
TCP - Part II Relates to Lab 5. This is an extended module that covers TCP flow control, congestion control, and error control in TCP.
Approaches towards congestion control
COMP 431 Internet Services & Protocols
TFRC for Voice: VoIP Variant and Faster Restart.
TCP - Part II Relates to Lab 5. This is an extended module that covers TCP flow control, congestion control, and error control in TCP.
ECE 599: Multimedia Networking Thinh Nguyen
CS640: Introduction to Computer Networks
TCP Congestion Control
TCP: Transmission Control Protocol Part II : Protocol Mechanisms
Presentation transcript:

Medium Start in TCP-Friendly Rate Control Protocol CS 217 Class Project Spring 04 Peter Leong & Michael Welch

TFRC Overview Congestion control scheme (CCID3) for transport layer protocols Mostly used for unreliable data flows Competes fairly with TCP for bandwidth Lower throughput variation over time than TCP Streaming multimedia Telephony data RFC 3448

TFRC Overview (cont) Streaming data are sent using UDP without congestion control Results an unfair sharing of the network bandwidth Transports without congestion control mechanisms run a higher risk of being selectively dropped by a router Provides feedback to sender about network condition

TFRC Algorithm The receiver measures the loss event rate and feeds this information back to the sender. The sender also uses these feedback messages to measure the round-trip time (RTT). The loss event rate and RTT are then fed into TFRC's throughput equation, giving the acceptable transmit rate. The sender then adjusts its transmit rate to match the calculated rate.

TFRC Algorithm -- Handling of idle periods Sender has a nofeedback timer Receiving a feedback packet resets the nofeedback timer to expire after 2*RTT Nofeedback timer expiration triggers halving of the send rate and timer reset e.g. An idle period of 10*RTT = halving send rate 5 times Exponential decrease of window size

TFRC Algorithm -- Handling of idle periods (cont) If the sender subsequently starts to send again, a normal slowstart phase will occur until the transmit rate reaches calculated fair rate. An idle period of several RTTs is not uncommon for voice-over-IP data transmission This means we often find ourselves sending data in slowstart (below our last measured fair rate) In general, we slowstart because we do not know current network conditions

Medium Start Assuming that fair rate is a good indicator of the actual available bandwidth within a reasonable time period, can we do better? With TFRC, we have a recent sample of the network through our fair rate calculation We can use this information to slowstart faster  Medium Start

Medium Start Algorithm Set T_idle := now – T_last_send F := (30 min - min(max(T_idle, 10 min), 30 min)) / 20 min Set ssthresh := F*rcvrate Set rate := max(4*size/RTT, rate) Set ssmult = 4 Perform traditional slowstart algorithm, including backoff mechanisms

Medium Start Evaluation We implemented Medium Start in ns-2 Compared achieved sending rate of TFRC with Medium Start vs. Stock TFRC Varied the loss rate, competing traffic type and density, and the source sending model. Results:

Evaluation Topology Node 0 : TFRC Sender Node 1 : Competing traffic source Node 2 : Router Node 3 : TFRC Receiver Links are 10Mb Losses occur on the 2-3 link only Router is DropTail Packetsize = 500 bytes

Evaluation 1 CBR sender No competing traffic 0.1 Mbps sending rate Link loss 15% X axis is time Y axis is sending rate in bytes

Evaluation 1 - Stock TFRC

Evaluation 1 – Medium Start

Evaluation 2 Exponentially distributed sender Mean burst time = 10s Mean idle time = 10s No competing traffic 0.1 Mbps burst sending rate Link loss 15% X axis is time Y axis is sending rate in bytes

Evaluation 2 – Stock TFRC

Evaluation 2 – Medium Start

Evaluation 3 Exponentially distributed sender Mean burst time = 10s Mean idle time = 10s 1 Mbps burst sending rate Exponentially distributed competing traffic Mean burst time = 5s Mean idle time = 5s 5 Mbps burst sending rate Link loss 10% X axis is time Y axis is sending rate in bytes

Evaluation 3 – Stock TFRC

Evaluation 3 – Medium Start

Benefits of Medium Start Utilizes recent measurements to reach our fair sending rate faster While still performing some conservative probing Allows higher fidelity for streaming media applications Allows higher utilization of the channel

Drawbacks of Medium Start Most test results show an increase in loss rate compared to Stock TFRC Relies on stable network dynamics May cause competing flows to experience additional loss  less TCP Friendly?

Problems and Open Issues ns-2 implementation of TFRC seems to deviate from the RFC Simulation does not allow us to perceive the improvement Medium Start may have on streaming multimedia and internet telephony An actual implementation would allow us to tweak the algorithm’s parameters through experimentation