CUBIC Qian HE (Steve) CS 577 – Prof. Bob Kinicki.

Slides:



Advertisements
Similar presentations
Impact of Background Traffic on Performance of High-speed TCPs
Advertisements

Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
A Survey of Recent High Speed TCP Variants
TCP Variants.
FAST TCP Anwis Das Ajay Gulati Slides adapted from : IETF presentation slides Link:
1 TCP Vegas: New Techniques for Congestion Detection and Avoidance Lawrence S. Brakmo Sean W. O’Malley Larry L. Peterson Department of Computer Science.
Congestion Control Algorithms: Open Questions Benno Overeinder NLnet Labs.
Lecturer: Namratha Vedire
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.
Ahmed El-Hassany CISC856: CISC 856 TCP/IP and Upper Layer Protocols Slides adopted from: Injong Rhee, Lisong Xu.
Selfish Behavior and Stability of the Internet: A Game-Theoretic Analysis of TCP Presented by Shariq Rizvi CS 294-4: Peer-to-Peer Systems.
Presentation by Joe Szymanski For Upper Layer Protocols May 18, 2015.
CUBIC : A New TCP-Friendly High-Speed TCP Variant Injong Rhee, Lisong Xu Member, IEEE v 0.2.
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.
TCP Stability and Resource Allocation: Part II. Issues with TCP Round-trip bias Instability under large bandwidth-delay product Transient performance.
Congestion Control on High-Speed Networks
Texas A&M University Improving TCP Performance in High Bandwidth High RTT Links Using Layered Congestion Control Sumitha.
The War Between Mice and Elephants Liang Guo and Ibrahim Matta Boston University ICNP 2001 Presented by Thangam Seenivasan 1.
High speed TCP’s. Why high-speed TCP? Suppose that the bottleneck bandwidth is 10Gbps and RTT = 200ms. Bandwidth delay product is packets (1500.
TCP on High-Speed Networks Sangtae Ha and Injong Rhee North Carolina State University.
High-performance bulk data transfers with TCP Matei Ripeanu University of Chicago.
TCP Congestion Control TCP sources change the sending rate by modifying the window size: Window = min {Advertised window, Congestion Window} In other words,
A Two-Phase TCP Congestion Control for Reducing Bias over Heterogeneous Networks Jongmin Lee, Hojung Cha, Rhan Ha Yonsei University, Korea Information.
The Effect of Router Buffer Size on HighSpeed TCP Performance Dhiman Barman Joint work with Georgios Smaragdakis and Ibrahim Matta.
1 Chapter 3 Transport Layer. 2 Chapter 3 outline 3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4.
Medium Start in TCP-Friendly Rate Control Protocol CS 217 Class Project Spring 04 Peter Leong & Michael Welch.
1 A State Feedback Control Approach to Stabilizing Queues for ECN- Enabled TCP Connections Yuan Gao and Jennifer Hou IEEE INFOCOM 2003, San Francisco,
Introduction 1 Lecture 14 Transport Layer (Congestion Control) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science.
Transport Layer 4 2: Transport Layer 4.
Computer Networking Lecture 17 – TCP Performance & Future Eric Anderson Fall
Principles of Congestion Control Congestion: informally: “too many sources sending too much data too fast for network to handle” different from flow control!
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.
Congestion Control for High Bandwidth-Delay Product Networks D. Katabi (MIT), M. Handley (UCL), C. Rohrs (MIT) – SIGCOMM’02 Presented by Cheng.
BIC Control for Fast Long-Distance Networks paper written by Injong Rhee, Lisong Xu & Khaled Harfoush (2004) Presented by Jonathan di Costanzo (2009/02/18)
Performance of New Variants of TCP Presenter – Bob Kinicki.
TCP with Variance Control for Multihop IEEE Wireless Networks Jiwei Chen, Mario Gerla, Yeng-zhong Lee.
TCP CUBIC in ns-3 CS577 Brett Levasseur 12/10/2013.
Lecture 9 – More TCP & Congestion Control
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.
Transport Layer 3-1 Chapter 3 Transport Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March
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.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429/556 Introduction to Computer Networks Principles of Congestion Control Some slides.
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
XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science
Performance of New Variants of TCP Presenter – Bob Kinicki.
Analysis and Design of an Adaptive Virtual Queue (AVQ) Algorithm for AQM By Srisankar Kunniyur & R. Srikant Presented by Hareesh Pattipati.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
INDIANAUNIVERSITYINDIANAUNIVERSITY Status of FAST TCP and other TCP alternatives John Hicks TransPAC HPCC Engineer Indiana University APAN Meeting – Hawaii.
An Analysis of AIMD Algorithm with Decreasing Increases Yunhong Gu, Xinwei Hong, and Robert L. Grossman National Center for Data Mining.
@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.
1 Stochastic Ordering for Internet Congestion Control Han Cai, Do Young Eun, Sangtae Ha, Injong Rhee, and Lisong Xu PFLDnet 2007 February 7, 2007.
Congestion Control for High Bandwidth-Delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs Presented by Yufei Chen.
Network Congestion Control HEAnet Conference 2005 (David Malone for Doug Leith)
TCP Vegas Congestion Control Algorithm
CUBIC Marcos Vieira.
Chapter 6 TCP Congestion Control
Introduction to Congestion Control
Transport Protocols over Circuits/VCs
TransPAC HPCC Engineer
Lecture 19 – TCP Performance
TCP Cubic CS577 Brett Levasseur 10/1/2013.
Chapter 6 TCP Congestion Control
Transport Layer: Congestion Control
Review of Internet Protocols Transport Layer
Presentation transcript:

CUBIC Qian HE (Steve) CS 577 – Prof. Bob Kinicki

Agenda Brief Introduction of CUBIC Prehistory of CUBIC – Standard TCP – BIC CUBIC Conclusion 1

Brief Introduction CUBIC is a less aggressive and more systematic derivative of BIC, in which the window is a cubic function of time since the last congestion event, with the inflection point set to the window prior to the event. 2

Why do we need CUBIC-TCP? Compares to: – Standard TCP – BIC-TCP 3

Standard TCP Underutilization of the bandwidth in High-Speed Network Cannot fully utilize the huge capacity of high- speed networks! NS-2 Simulation (100 sec) Link Capacity = 155Mbps, 622Mbps, 2.5Gbps, 5Gbps, 10Gbps, Drop-Tail Routers, 0.1BDP Buffer 5 TCP Connections, 100ms RTT, 1000-Byte Packet Size 4 Presentation: "Congestion Control on High-Speed Networks”, Injong Rhee, Lisong Xu, Slide 6

Standard TCP Low window size resilience to packet loss in High-Speed Network Packet loss Time (RTT)Congestion avoidance Packet loss cwnd Slow start Packet loss 100,00010Gbps 50,0005Gbps 1.4 hours TCP Slow Increase cwnd = cwnd + 1 Slow Increase cwnd = cwnd + 1 Fast Decrease cwnd = cwnd * 0.5 Fast Decrease cwnd = cwnd * Presentation: "Congestion Control on High-Speed Networks”, Injong Rhee, Lisong Xu, Slide 7

Why BIC? Existing schemes have a severe RTT unfairness problem RTT unfairness for high-speed networks occurs distinctly with drop tail routers for flows with large congestion windows where packet loss can be highly synchronized. 6

BIC “Binary Increase Congestion Control (BIC) for Fast Long-Distance Networks”, Lisong Xu, Khaled Harfoush, and Injong Rhee, IEEE INFOCOM

Goals of BIC Scalability: BIC can scale its bandwidth share to 10 Gbps around 3.5e-8 loss rates (comparable to HSTCP which reaches 10Gbps at 1e-7). RTT fairness: for large windows, BIC’s RTT unfairness is proportional to the inverse square of the RTT ratio as in AIMD. TCP friendliness: BIC achieves bounded TCP fairness for all window sizes. Around high loss rates where TCP performs well, its TCP friendliness is comparable to STCP’s. Fairness and convergence: compared to HSTCP and STCP, BIC achieves better bandwidth fairness over both short and long time scales, and faster convergence to a fair bandwidth share. 8

BIC Algorithm If cwnd < low_window, normal TCP: – ACK received cwnd = cwnd + 1 – Enter recovery cwnd = cwnd * 0.5 Else, BIC 9

BIC Algorithm ACK received – If cwnd < Wmax cwnd += (Wmax – cwnd) / 2 – Else cwnd += cwnd - Wmax Recovery – If cwnd < Wmax Wmax = cwnd * (1 – ß / 2) – Else Wmax = cwnd – cwnd *= 1 - ß Smin <= cwnd && cwnd <=Smax Smin <= cwnd && cwnd <=Smax 10

BIC with no lost Smax Smin 11

12 "Binary Increase Congestion Control (BIC) for Fast Long-Distance Networks", Lisong Xu, Khaled Harfoush, and Injong Rhee

Why CUBIC? Window control of BIC is so complex! BIC’s growth function can still be too aggressive for TCP, especially under short RTT or low speed networks. BIC still has room for improving TCP- friendliness and RTT-fairness! 13

CUBIC Algorithm ACK received – C is a scaling factor – t is the elapsed time from the last window reduction – Wmax is the window size just before the last window reduction – K is updated at the time of last lost event Recovery – Update K with: – Update Wmax with: – β is a constant multiplication decrease factor cwnd cannot be less than as to keep the growth rate the same as standard TCP in short RTT networks. cwnd cannot be less than as to keep the growth rate the same as standard TCP in short RTT networks. 14

CUBIC window curves with competing flows (NS simulation in a network with 500Mbps and 100ms RTT), C = 0.4, β =

Window Growth Function CUBIC BIC 16 "CUBIC: A New TCP-Friendly High-Speed TCP Variant", Injong Rhee, and Lisong Xu

Stability 4 flows of a high-speed TCP variant over a long-RTT network path (~220ms) 4 flows of long-term TCP-SACK flows over a short-RTT path (~20ms) 17 "CUBIC: A New TCP-Friendly High-Speed TCP Variant", Injong Rhee, and Lisong Xu

Coefficient of Variation (CoV) “There is no well-defined metric of stability.” “Often the CoV of transmission rates are used to depict stability.” “For a less satisfactory measure, we plotted the CoV of throughput.” 18 "CUBIC: A New TCP-Friendly High-Speed TCP Variant", Injong Rhee, and Lisong Xu

CoV - 20% BDP 19 "CUBIC: A New TCP-Friendly High-Speed TCP Variant", Injong Rhee, and Lisong Xu

CoV - 200% BDP 20 "CUBIC: A New TCP-Friendly High-Speed TCP Variant", Injong Rhee, and Lisong Xu

Thanks