Fast TCP Cheng JinDavid WeiSteven Low Caltech Infocom, March 2004 Offense Team: Santa & Animesh.

Slides:



Advertisements
Similar presentations
TCP Variants.
Advertisements

1 School of Computing Science Simon Fraser University CMPT 771/471: Internet Architecture & Protocols TCP-Friendly Transport Protocols.
The Importance of Being TCP-Friendly Eiman Zolfaghari E190 – Professor Hatton May 2002 UDP TCP DCP.
FAST TCP Anwis Das Ajay Gulati Slides adapted from : IETF presentation slides Link:
Cheng Jin David Wei Steven Low FAST TCP: design and experiments.
1 TCP Vegas: New Techniques for Congestion Detection and Avoidance Lawrence S. Brakmo Sean W. O’Malley Larry L. Peterson Department of Computer Science.
TCP Vegas LAWRENCE S. BRAKMO SEAN W. O’MALLEY LARRY L. PETERSON PRESENTED TCP VEGAS IN 1994 PRESENTED BY CHUNG TRAN.
WHITE – Achieving Fair Bandwidth Allocation with Priority Dropping Based on Round Trip Time Name : Choong-Soo Lee Advisors : Mark Claypool, Robert Kinicki.
CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
Ahmed El-Hassany CISC856: CISC 856 TCP/IP and Upper Layer Protocols Slides adopted from: Injong Rhee, Lisong Xu.
CUBIC : A New TCP-Friendly High-Speed TCP Variant Injong Rhee, Lisong Xu Member, IEEE v 0.2.
Congestion Control An Overview -Jyothi Guntaka. Congestion  What is congestion ?  The aggregate demand for network resources exceeds the available capacity.
Congestion Control on High-Speed Networks
Multirate Congestion Control Using TCP Vegas Throughput Equations Anirban Mahanti Department of Computer Science University of Calgary Calgary, Alberta.
Network Congestion Gabriel Nell UC Berkeley. Outline Background: what is congestion? Congestion control – End-to-end – Router-based Economic insights.
Texas A&M University Improving TCP Performance in High Bandwidth High RTT Links Using Layered Congestion Control Sumitha.
1 USC INFORMATION SCIENCES INSTITUTE RAP: An End-to-End Congestion Control Mechanism for Realtime Streams in the Internet Reza Rejaie, Mark Handley, Deborah.
18 Nov 2009 TCP VEGAS Mohammad AlKurbi CMPT – 771: Internet Architecture and Protocols.
Congestion control in data centers
1 Equation-Based Congestion Control for Unicast Applications Sally Floyd, Mark Handley, Jitendra Padhye & Jorg Widmer August 2000, ACM SIGCOMM Computer.
1 EE 627 Lecture 11 Review of Last Lecture UDP & Multimedia TCP & UDP Interaction.
Cheng Jin David Wei Steven Low FAST TCP: Motivation, Architecture, Algorithms, Performance.
RAP: An End-to-End Rate-Based Congestion Control Mechanism for Realtime Streams in the Internet Reza Rejai, Mark Handley, Deborah Estrin U of Southern.
1 Minseok Kwon and Sonia Fahmy Department of Computer Sciences Purdue University {kwonm, TCP Increase/Decrease.
A Real-Time Video Multicast Architecture for Assured Forwarding Services Ashraf Matrawy, Ioannis Lambadaris IEEE TRANSACTIONS ON MULTIMEDIA, AUGUST 2005.
TCP Friendliness CMPT771 Spring 2008 Michael Jia.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
FTDCS 2003 Network Tomography based Unresponsive Flow Detection and Control Authors Ahsan Habib, Bharat Bhragava Presenter Mohamed.
Random Early Detection Gateways for Congestion Avoidance
Reliable Transport Layers in Wireless Networks Mark Perillo Electrical and Computer Engineering.
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
Low-Rate TCP Denial of Service Defense Johnny Tsao Petros Efstathopoulos Tutor: Guang Yang UCLA 2003.
CS :: Fall 2003 TCP Friendly Streaming Ketan Mayer-Patel.
Congestion Control for High Bandwidth-Delay Product Environments Dina Katabi Mark Handley Charlie Rohrs.
Advanced Computer Networks : RED 1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking,
Congestion control for multimedia Henning Schulzrinne Dept. of Computer Science Columbia University Fall 2003.
TCP Enhancement for Random Loss Jiang Wu Computer Science Lakehead University.
Much better than the old TCP Flavours 1Rajon Bhuiyan.
CS/EE 145A Congestion Control Netlab.caltech.edu/course.
TFRC: TCP Friendly Rate Control using TCP Equation Based Congestion Model CS 218 W 2003 Oct 29, 2003.
Implementing High Speed TCP (aka Sally Floyd’s) Yee-Ting Li & Gareth Fairey 1 st October 2002 DataTAG CERN (Kinda!)
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
0 Delayed Congestion Response Protocols Thesis By Sumitha Bhandarkar Under the Guidance of Dr. A. L. N. Reddy.
指導教授:林仁勇 老師 學生:吳忠融 2015/10/24 1. Author Chan, Y.-C. Chan, C.-T. Chen, Y.-C. Source IEE Proceedings of Communications, Volume 151, Issue 1, Feb 2004 Page(s):107.
High-speed TCP  FAST TCP: motivation, architecture, algorithms, performance (by Cheng Jin, David X. Wei and Steven H. Low)  Modifying TCP's Congestion.
Rate Control Rate control tunes the packet sending rate. No more than one packet can be sent during each packet sending period. Additive Increase: Every.
Congestion Control for High Bandwidth-Delay Product Networks D. Katabi (MIT), M. Handley (UCL), C. Rohrs (MIT) – SIGCOMM’02 Presented by Cheng.
Data Transport Challenges for e-VLBI Julianne S.O. Sansa* * With Arpad Szomoru, Thijs van der Hulst & Mike Garret.
Murari Sridharan and Kun Tan (Collaborators: Jingmin Song, MSRA & Qian Zhang, HKUST.
Recent Congestion Control Research at UCLA Presenter: Cesar Marcondes PhD Candidate CS/UCLA Chicago, July IRTF/ICCRG Meeting Presenter: Cesar Marcondes.
Compound TCP in NS-3 Keith Craig 1. Worcester Polytechnic Institute What is Compound TCP? As internet speeds increased, the long ‘ramp’ time of TCP Reno.
1 Sonia FahmyPurdue University TCP Congestion Control Sonia Fahmy Department of Computer Sciences Purdue University
NUS.SOC.CS5248 Ooi Wei Tsang Rate Adaptations. NUS.SOC.CS5248 Ooi Wei Tsang You are Here Network Encoder Sender Middlebox Receiver Decoder.
Thoughts on the Evolution of TCP in the Internet (version 2) Sally Floyd ICIR Wednesday Lunch March 17,
We used ns-2 network simulator [5] to evaluate RED-DT and compare its performance to RED [1], FRED [2], LQD [3], and CHOKe [4]. All simulation scenarios.
NUS.SOC.CS Roger Zimmermann (based in part on slides by Ooi Wei Tsang) Rate Adaptations.
Data Transport Challenges for e-VLBI Julianne S.O. Sansa* * With Arpad Szomoru, Thijs van der Hulst & Mike Garret.
Murari Sridharan Windows TCP/IP Networking, Microsoft Corp. (Collaborators: Kun Tan, Jingmin Song, MSRA & Qian Zhang, HKUST)
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.
FAST TCP Cheng Jin David Wei Steven Low netlab.CALTECH.edu GNEW, CERN, March 2004.
Congestion Control for High Bandwidth-Delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs Presented by Yufei Chen.
© 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.
Sandeep Kakumanu Smita Vemulapalli Gnan
Analysis and Comparison of TCP Reno and TCP Vegas Review
TCP Vegas Congestion Control Algorithm
Rate Adaptations.
Fast TCP Matt Weaver CS622 Fall 2007.
ECE 599: Multimedia Networking Thinh Nguyen
RAP: Rate Adaptation Protocol
Presentation transcript:

Fast TCP Cheng JinDavid WeiSteven Low Caltech Infocom, March 2004 Offense Team: Santa & Animesh

Comp 629, Spring 2004Santa & Animesh Delay-based Approach In general, Equation-based approach is needed for steady-state and high utilization Congestion measure – delay, loss, … We agree with the argument : Delay-based approach is better than loss-based approach Multi-bit information compared to one-bit Earlier detection of impending congestion More frequent feedback possible

Comp 629, Spring 2004Santa & Animesh Is the approach novel? NO. Delay-based approaches have been proposed for the last 15 years Including their earlier paper last year Half the theory of this paper is a copy of their earlier paper, IEEE CCW 2000

Comp 629, Spring 2004Santa & Animesh (Just) A few Prior Art Raj jain, A Delay-based approach for congestion avoidance in interconnected heterogeneous computer network. ACM Sigcomm, ‘89 Martin, Nilsson and Rhee, Delay-based congestion avoidance for TCP, IEEE ToN, June 2003 Sisalem and Schulzrinne, The Loss-Delay Adjustment Algorithm: A TCP friendly adaptation Scheme. NOSSDAV, ‘98 Rejaie, Handley, Estrin, RAP:An end-to-end Rate-based Congestion Control Mechanism for Realtime Streams in the Internet. Infocom ‘99 Floyd et. al., Equation based congestion control for unicast applications. Sigcomm ’00 Brakmo and Peterson, TCP Vegas: end-to-end congestion avoidance on a global internet. IEEE JSAC, Oct 1995 Choe and Low, Stabilized Vegas. Infocom ‘03

Comp 629, Spring 2004Santa & Animesh Comparison with WHAT ??? Compared their approach to 3 other loss- based approaches. Why not delay-based approaches Other approaches? Particularly, TCP-Vegas Explicit Congestion Notification (ECN) Sneaking suspicion: Did they actually compare, and was on the losing side?

Comp 629, Spring 2004Santa & Animesh Inter-Protocol Fairness All transport protocols should be TCP friendly for compatible with a deployed standard TCP-friendliness – Maintaining arrival rate to at most some constant over the square root of the packet loss rate No claim for TCP-friendliness in this paper

Comp 629, Spring 2004Santa & Animesh TCP-Friendly

Comp 629, Spring 2004Santa & Animesh Deployment Issues A proposal should have incremental deployment characteristic. Lot of excellent proposals have not seen the day of light because of this Examples: TCP-Vegas, SACK, Multicast So, just yet another paper…read & forget

Comp 629, Spring 2004Santa & Animesh Evaluation Flaws Wrong comparison choices Incomplete evaluation

Comp 629, Spring 2004Santa & Animesh Intra-Protocol Fairness - Showed better fairness index but themselves claim it not being 1. - Compare against HSTCP, STCP which were protocols optimized for high throughput and not fairness - Why not compare against TCP WestWood and Easy RED or TCP-Vegas ? TCP WestWood and Easy RED to improve Fairness in high speed networks. PfHSN’02

Comp 629, Spring 2004Santa & Animesh Intra-Protocol Fairness Contd. Maintaining intra-protocol fairness when some of the connections have large propagation delay is difficult. Global Fairness of Additive-Increase and Multiplicative-Decrease With Heterogeneous Round- Trip Times. Infocom 2000 FAST-TCP fails here, but TCP Vegas was shown to successful.

Comp 629, Spring 2004Santa & Animesh Inter-Protocol Fairness TCP Vegas paper clearly demonstrates their effectiveness in being TCP friendly using : When Reno competes with Vegas, Vegas’s flow does not throttle Reno. Also the total retransmissions drops when Reno competes with Vegas as compared to Reno against Vegas. Background traffics’s throughput increased by 20% when Reno is competing with Vegas as compared to Reno competing with itself.

Comp 629, Spring 2004Santa & Animesh Are you afraid to hit the roads ? Are conclusions based on dummynet experiments sufficient ? ns simulation, WAN emulation, real deployment

Comp 629, Spring 2004Santa & Animesh Conclusion Theoretically sound in advocating Delay Based approaches But this is prior work Did not convince me why FAST TCP is the choice as compared to other delay based approaches. Weak and Incomplete Evaluation Fairness issues is questionable Wrong comparison choices Experimental with realistic scenarios necessary

Comp 629, Spring 2004Santa & Animesh TCP-Vegas Expected Rate = Curr wind Size / Min RTT Actual Rate = Bytes sent during RTT / Current RTT Diff (Expected – Actual) should remain within limits