Fast TCP Matt Weaver CS622 Fall 2007.

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.
Helping TCP Work at Gbps Cheng Jin the FAST project at Caltech
TCP Variants.
FAST TCP Anwis Das Ajay Gulati Slides adapted from : IETF presentation slides Link:
Internet Protocols Steven Low CS/EE netlab.CALTECH.edu October 2004 with J. Doyle, L. Li, A. Tang, J. Wang.
Cheng Jin David Wei Steven Low FAST TCP: design and experiments.
1 End to End Bandwidth Estimation in TCP to improve Wireless Link Utilization S. Mascolo, A.Grieco, G.Pau, M.Gerla, C.Casetti Presented by Abhijit Pandey.
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.
Microscopic Behavior of Internet Control Xiaoliang (David) Wei NetLab, CS&EE California Institute of Technology.
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.
NS-2 TCP-Linux David Wei and Pei Cao. Outline Motivation Motivation Code structure of NS-2 TCP-Linux agent Code structure of NS-2 TCP-Linux agent Design.
CUBIC Qian HE (Steve) CS 577 – Prof. Bob Kinicki.
Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.
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.
Texas A&M University Improving TCP Performance in High Bandwidth High RTT Links Using Layered Congestion Control Sumitha.
Recent Research in Congestion Control The problem of high bandwidth-delay product connections By Guillaume Marceau Presented for WPI CS577, Advanced Computer.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
High speed TCP’s. Why high-speed TCP? Suppose that the bottleneck bandwidth is 10Gbps and RTT = 200ms. Bandwidth delay product is packets (1500.
Cheng Jin David Wei Steven Low FAST TCP: Motivation, Architecture, Algorithms, Performance.
Heterogeneous Congestion Control Protocols Steven Low CS, EE netlab.CALTECH.edu with A. Tang, J. Wang, D. Wei, Caltech M. Chiang, Princeton.
A Real-Time Video Multicast Architecture for Assured Forwarding Services Ashraf Matrawy, Ioannis Lambadaris IEEE TRANSACTIONS ON MULTIMEDIA, AUGUST 2005.
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 Environments Dina Katabi Mark Handley Charlie Rohrs.
1 A State Feedback Control Approach to Stabilizing Queues for ECN- Enabled TCP Connections Yuan Gao and Jennifer Hou IEEE INFOCOM 2003, San Francisco,
1 Robust Transport Protocol for Dynamic High-Speed Networks: enhancing XCP approach Dino M. Lopez Pacheco INRIA RESO/LIP, ENS of Lyon, France Congduc Pham.
Much better than the old TCP Flavours 1Rajon Bhuiyan.
CS/EE 145A Congestion Control Netlab.caltech.edu/course.
Understanding the Performance of TCP Pacing Amit Aggarwal, Stefan Savage, Thomas Anderson Department of Computer Science and Engineering University of.
Parameswaran, Subramanian
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
High-speed TCP  FAST TCP: motivation, architecture, algorithms, performance (by Cheng Jin, David X. Wei and Steven H. Low)  Modifying TCP's Congestion.
Requirements for Simulation and Modeling Tools Sally Floyd NSF Workshop August 2005.
Acknowledgments S. Athuraliya, D. Lapsley, V. Li, Q. Yin (UMelb) S. Adlakha (UCLA), J. Doyle (Caltech), K. Kim (SNU/Caltech), F. Paganini (UCLA), J. Wang.
Congestion Control for High Bandwidth-Delay Product Networks D. Katabi (MIT), M. Handley (UCL), C. Rohrs (MIT) – SIGCOMM’02 Presented by Cheng.
Performance of New Variants of TCP Presenter – Bob Kinicki.
Analysis of Buffer Size in Core Routers by Arthur Dick Supervisor Anirban Mahanti.
1 Transport Control Protocol for Wireless Connections ElAarag and Bassiouni Vehicle Technology Conference 1999.
1 Analysis of a window-based flow control mechanism based on TCP Vegas in heterogeneous network environment Hiroyuki Ohsaki Cybermedia Center, Osaka University,
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.
The Macroscopic behavior of the TCP Congestion Avoidance Algorithm.
An Evaluation of Fairness Among Heterogeneous TCP Variants Over 10Gbps High-speed Networks Lin Xue*, Suman Kumar', Cheng Cui* and Seung-Jong Park* *School.
Performance of New Variants of TCP Presenter – Bob Kinicki.
Fast TCP Cheng JinDavid WeiSteven Low Caltech Infocom, March 2004 Offense Team: Santa & Animesh.
Access Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla Computer Science Department, University of.
1 Stochastic Ordering for Internet Congestion Control Han Cai, Do Young Eun, Sangtae Ha, Injong Rhee, and Lisong Xu PFLDnet 2007 February 7, 2007.
Delay-based Congestion Control for Multipath TCP Yu Cao, Mingwei Xu, Xiaoming Fu Tsinghua University University of Goettingen.
Analysis and Comparison of TCP Reno and TCP Vegas Review
Accelerating Peer-to-Peer Networks for Video Streaming
CUBIC Marcos Vieira.
COMP 431 Internet Services & Protocols
Introduction to Congestion Control
Transport Protocols over Circuits/VCs
TCP Congestion Control
TransPAC HPCC Engineer
SCTP v/s TCP – A Comparison of Transport Protocols for Web Traffic
Queue Dynamics with Window Flow Control
TCP Westwood(+) Protocol Implementation in ns-3
Lecture 19 – TCP Performance
ECE 599: Multimedia Networking Thinh Nguyen
FAST TCP : From Theory to Experiments
Stability of Congestion Control Algorithms Using Control Theory with an application to XCP Ioannis Papadimitriou George Mavromatis.
TCP Congestion Control
CSE 4213: Computer Networks II
Record and Playback PHY Abstraction for n MAC Simulations
Review of Internet Protocols Transport Layer
Presentation transcript:

Fast TCP Matt Weaver CS622 Fall 2007

FAST TCP: Motivation, Architecture, Algorithms, Performance David X. Wei, Student Member, IEEE, Cheng Jin, Steven H. Low, Senior Member, IEEE, and Sanjay Hegde 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance

FAST TCP: Motivation, Architecture, Algorithms, Performance Abstract FAST TCP is a congestion control algorithm that attempts to solve the problems of congestion control. This paper covers: The algorithm itself. Performance metrics 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 3

FAST TCP: Motivation, Architecture, Algorithms, Performance Background “Congestion control is a distributed algorithm to share network resources among competing users.” A difficult problem to solve... Resource needs vary, depending on time of day. Available resources is usually static. 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 4

FAST TCP: Motivation, Architecture, Algorithms, Performance FAST is a recursive acronym: FAST AQM Scalable TCP AQM: Active Queue Management TCP: Transmission Control Protocol (duh) 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 5

FAST TCP: Motivation, Architecture, Algorithms, Performance Current Issues As congestion is monitored, current algorithms slow down monitoring as packets are dropped, the average sending rate depends on low loss probability. High data transmission rates are required for low loss. Usually lower than WiFi can support. 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 6

FAST TCP: Motivation, Architecture, Algorithms, Performance Solution FAST TCP uses queues to store a constant number of packets. If too few packets are queued, the sending rate increases. If too few, the rate decreases. 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 7

FAST TCP: Motivation, Architecture, Algorithms, Performance Congestion Control Current TCP congestion control algorithm (aka Reno). At the packet level, linear increase by one packet per roundtrip time (RTT) is too slow, and multiplicative decrease per loss event is too drastic. At the flow level, maintaining large average congestion windows requires an extremely small equilibrium loss probability. At the packet level, oscillation in congestion window is unavoidable because TCP uses a binary congestion signal (packet loss). At the flow level, the dynamics is unstable, leading to severe oscillations that can only be reduced by the accurate estimation of packet loss probability and a stable design of the flow dynamics. 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 8

FAST TCP: Motivation, Architecture, Algorithms, Performance Motivations Two levels of design: The flow level (macroscopic) covers: QoS Stability etc Packet level (microscopic) covers: The same goals, but focused on end to end. Reno suffered because higher level control was considered after the micro level. 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 9

FAST TCP: Motivation, Architecture, Algorithms, Performance Calculations Congestion and utility: U calculates utility for each stakeholder (user) at a given flow. 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 10

FAST TCP: Motivation, Architecture, Algorithms, Performance Calculations Equilibrium (FAST): Equilibrium (Reno): 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 11

FAST TCP: Motivation, Architecture, Algorithms, Performance Calculations “A key departure of our model from those in the literature is that we assume that a source’s send rate, defined as xi(t) :=wi(t)=Ti(t), cannot exceed the throughput it receives. “ 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 12

FAST TCP: Motivation, Architecture, Algorithms, Performance Dynamic Structure The weakness of current schemes versus FAST is shown for large window sizes. 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 13

FAST TCP: Motivation, Architecture, Algorithms, Performance Equilibrium Equilibrium measures congestion consistency. 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 14

FAST TCP: Motivation, Architecture, Algorithms, Performance Differences Though all of the aforementioned algorithms look different at the packet level, they actually have similar structures at the flow and equilibrium levels. 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 15

FAST TCP: Motivation, Architecture, Algorithms, Performance Performance Test 1 To test performance, packet data is pushed through a semi-articial network. Identical sender and receiver boxes, running dummynet on FreeBSD. Emulated router. Dummynet running: Paths with RTTs of 50, 100, 150, and 200ms. Second path with a bottleneck capacity of 8M/s and a buffer size of 2,000 packets shared by all the delay pipes. 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 16

FAST TCP: Motivation, Architecture, Algorithms, Performance Results Dynamic state I: Small flows, large windows Dynamic state II: Larger flows 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 17

FAST TCP: Motivation, Architecture, Algorithms, Performance Dynamic State I 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 18

FAST TCP: Motivation, Architecture, Algorithms, Performance Throughput kbps Queue(avg) # of pkts FAST vs Reno I Sec 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 19

FAST TCP: Motivation, Architecture, Algorithms, Performance Dynamic State II 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 20

FAST TCP: Motivation, Architecture, Algorithms, Performance Dynamic State II 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 21

FAST TCP: Motivation, Architecture, Algorithms, Performance FAST vs Reno II 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 22

FAST TCP: Motivation, Architecture, Algorithms, Performance BIC 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 23

FAST TCP: Motivation, Architecture, Algorithms, Performance Performance Test 2 Dummynet tests are limited to a single bottleneck and the same protocols. NS-2 Simulation run in lab: Same algorithm. Noise added to eliminate phase artifacts. 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 24

FAST TCP: Motivation, Architecture, Algorithms, Performance 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 25

FAST TCP: Motivation, Architecture, Algorithms, Performance 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 26

FAST TCP: Motivation, Architecture, Algorithms, Performance 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 27

FAST TCP: Motivation, Architecture, Algorithms, Performance 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 28

FAST TCP: Motivation, Architecture, Algorithms, Performance 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 29

FAST TCP: Motivation, Architecture, Algorithms, Performance 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 30

FAST TCP: Motivation, Architecture, Algorithms, Performance Conclusion Because of the use of queues, FAST TCP can handle lower transmission rates. The paper also covers some simulated scenarios (too lengthy to cover properly here). 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 31

FAST TCP: Motivation, Architecture, Algorithms, Performance Caveat Emptor Possibly biased research: Jin Cheng, Steve Low, and David Wei (the authors) patented and market the FAST TCP algorithm. FAST TCP implementation sold as FastSoft Aria (a 1 U rack mountable hardware solution). http://www.fastsoft.com/ Ao Tang proposed that these measurements were somewhat misleading in another paper. 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 32

FAST TCP: Motivation, Architecture, Algorithms, Performance Other CC Algorithms BIC TCP Compound TCP CUBIC H-TCP High Speed TCP HSTCP-LP Hybla New Reno Tahoe TCP-Illinois TCP-LP TCP-SACK TCP-Veno Westwood Westwood+ XCP YeAH-TCP 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 33

FAST TCP: Motivation, Architecture, Algorithms, Performance Related Work Tang, A., Wang, J., Low, S. H., and Chiang, M. 2007. Equilibrium of heterogeneous congestion control: existence and uniqueness. IEEE/ACM Trans. Netw. 15, 4 (Aug. 2007), 824-837. DOI= http://dx.doi.org/10.1109/TNET.2007.893885 Ma, J., Ruutu, J., and Wu, J. 2000. An enhanced TCP mechanism—fast-TCP in IP networks with wireless links. Wirel. Netw. 6, 5 (Nov. 2000), 375-379. DOI= http://dx.doi.org/10.1023/A:1019118421144 Gu, Y., Hong, X., and Grossman, R. L. 2004. Experiences in Design and Implementation of a High Performance Transport Protocol. In Proceedings of the 2004 ACM/IEEE Conference on Supercomputing (November 06 - 12, 2004). Conference on High Performance Networking and Computing. IEEE Computer Society, Washington, DC, 22. DOI= http://dx.doi.org/10.1109/SC.2004.24 Grieco, L. A. and Mascolo, S. 2004. Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control. SIGCOMM Comput. Commun. Rev. 34, 2 (Apr. 2004), 25-38. DOI= http://doi.acm.org/10.1145/997150.997155 24/11/2018 FAST TCP: Motivation, Architecture, Algorithms, Performance 34